2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)最新文献_第8页

Shortfall-Based Optimal Security Provisioning for Internet of Things 基于缺陷的物联网安全优化配置

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.12

Antonino Rullo, Edoardo Serra, E. Bertino, Jorge Lobo

引用次数: 7

Optimizing Source Selection in Social Sensing in the Presence of Influence Graphs 影响图存在下的社会感知源选择优化

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.275

Huajie Shao, Shiguang Wang, Shen Li, Shuochao Yao, Yiran Zhao, Md. Tanvir Al Amin, T. Abdelzaher, Lance M. Kaplan

{"title":"Optimizing Source Selection in Social Sensing in the Presence of Influence Graphs","authors":"Huajie Shao, Shiguang Wang, Shen Li, Shuochao Yao, Yiran Zhao, Md. Tanvir Al Amin, T. Abdelzaher, Lance M. Kaplan","doi":"10.1109/ICDCS.2017.275","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.275","url":null,"abstract":"This paper addresses the problem of choosing the right sources to solicit data from in sensing applications involving broadcast channels, such as those crowdsensing applications where sources share their observations on social media. The goal is to select sources such that expected fusion error is minimized. We assume that soliciting data from a source incurs a cost and that the cost budget is limited. Contrary to other formulations of this problem, we focus on the case where some sources influence others. Hence, asking a source to make a claim affects the behavior of other sources as well, according to an influence model. The paper makes two contributions. First, we develop an analytic model for estimating expected fusion error, given a particular influence graph and solution to the source selection problem. Second, we use that model to search for a solution that minimizes expected fusion error, formulating it as a zero-one integer non-linear programming (INLP) problem. To scale the approach, the paper further proposes a novel reliability-based pruning heuristic (RPH) and a similarity-based lossy estimation (SLE) algorithm that significantly reduce the complexity of the INLP algorithm at the cost of a modest approximation. The analytically computed expected fusion error is validated using both simulations and real-world data from Twitter, demonstrating a good match between analytic predictions and empirical measurements. It is also shown that our method outperforms baselines in terms of resulting fusion error.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127500512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 8

Robust Indoor Wireless Localization Using Sparse Recovery 基于稀疏恢复的鲁棒室内无线定位

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.142

Wei Gong, Jiangchuan Liu

{"title":"Robust Indoor Wireless Localization Using Sparse Recovery","authors":"Wei Gong, Jiangchuan Liu","doi":"10.1109/ICDCS.2017.142","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.142","url":null,"abstract":"With the multi-antenna design of WiFi interfaces, phased array has become a promising mechanism for accurateWiFi localization. State-of-the-art WiFi-based solutions using AoA (Angle-of-Arrival), however, face a number of critical challenges. First, their localization accuracy degrades dramatically when the Signal-to-Noise Ratio (SNR) becomes low. Second, they do not fully utilize coherent processing across all available domains. In this paper, we present ROArray, a Robust Array based system that accurately localizes a target even with low SNRs. In the spatial domain, ROArray can produce sharp AoA spectrums by parameterizing the steering vector based on a sparse grid. Then, to expand into the frequency domain, it jointly estimates the ToAs (Time-of-Arrival) and AoAs of all the paths using multi-subcarrier OFDM measurements. Furthermore, through multi-packet fusion, ROArray is enabled to perform coherent estimation across the spatial, frequency, and time domains. Such coherent processing not only increases the virtual aperture size, which enlarges the number of maximum resolvable paths, but also improves the system robustness to noise. Our implementation using off-the-shelf WiFi cards demonstrates that, with low SNRs, ROArray significantly outperforms state-of-the-art solutions in terms of localization accuracy; when medium or high SNRs are present, it achieves comparable accuracy.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125900699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 35

Speculative Slot Reservation: Enforcing Service Isolation for Dependent Data-Parallel Computations 推测槽位保留:为依赖数据并行计算强制服务隔离

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.174

Chen Chen, Wei Wang, Bo Li

{"title":"Speculative Slot Reservation: Enforcing Service Isolation for Dependent Data-Parallel Computations","authors":"Chen Chen, Wei Wang, Bo Li","doi":"10.1109/ICDCS.2017.174","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.174","url":null,"abstract":"Priority scheduling is a fundamental tool to provide service isolation for different jobs in shared clusters. Ideally, the performance of a high-priority job should not be dragged down by another with a lower priority. However, we show in this paper that simply assigning a high priority provides no isolation for jobs with dependent computations. A job, even receiving the highest priority, may give up compute slots to another before proceeding to the downstream computation, which is because of barrier, i.e., that the downstream computation cannot start until all the upstream tasks have completed. Such an interruption of execution inevitably results in a significant delay. In this paper, we propose speculative slot reservation that judiciously reserves slots for downstream computations, so as to retain service isolation for high-priority jobs. To mitigate the utilization loss due to slot reservation, we analyze the trade-off between utilization and isolation, and expose a tunable knob to navigate the trade-off. We also propose a complementary straggler mitigation strategy that uses the reserved slots to run extra copies of slow tasks. We have implemented speculative slot reservation in Spark. Evaluations based on both cluster deployment and trace-driven simulations show that our approach enforces strict service isolation for high-priority jobs, without slowing down the other jobs with a lower priority.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125557279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Self-Evolving Subscriptions for Content-Based Publish/Subscribe Systems 基于内容的发布/订阅系统的自进化订阅

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.277

César Cañas, Kaiwen Zhang, Bettina Kemme, J. Kienzle, H. Jacobsen

{"title":"Self-Evolving Subscriptions for Content-Based Publish/Subscribe Systems","authors":"César Cañas, Kaiwen Zhang, Bettina Kemme, J. Kienzle, H. Jacobsen","doi":"10.1109/ICDCS.2017.277","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.277","url":null,"abstract":"Traditional pub/sub systems cannot adequately handle workloads of applications with dynamic, short-lived subscriptions such as location-based social networks, predictive stock trading, and online games. Subscribers must continuously interact with the pub/sub system to remove and insert subscriptions, thereby inefficiently consuming network and computing resources, and sacrificing consistency. In the aforementioned applications, we recognize that the changes in the subscriptions can follow a predictable pattern over some variable (e.g., time). In this paper, we present a new type of subscription, called evolving subscription, which encapsulates these patterns and allow the pub/sub system to autonomously adapt to the dynamic interests of the subscribers without incurring an expensive re-subscription overhead. We propose a general model for expressing evolving subscriptions and a framework for supporting them in a pub/sub system. To this end, we propose three different designs to support evolving subscriptions, which are evaluated and compared to the traditional resubscription approach in the context of two use cases: online games and high-frequency trading. Our evaluation shows that our solutions can reduce subscription traffic by 96.8% and improve delivery accuracy when compared to the baseline resubscription mechanism.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114416690","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Efficient Z-Order Encoding Based Multi-Modal Data Compression in WSNs 基于高效z阶编码的wsn多模态数据压缩

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.15

Xiaofei Cao, S. Madria, T. Hara

引用次数: 4

A Framework for Efficient Energy Scheduling of Spark Workloads 一种高效的Spark工作负载能量调度框架

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.179

Stathis Maroulis, Nikos Zacheilas, V. Kalogeraki

引用次数: 15

Robust Multi-tenant Server Consolidation in the Cloud for Data Analytics Workloads 数据分析工作负载在云中健壮的多租户服务器整合

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.144

Joseph Mate, Khuzaima S. Daudjee, Shahin Kamali

{"title":"Robust Multi-tenant Server Consolidation in the Cloud for Data Analytics Workloads","authors":"Joseph Mate, Khuzaima S. Daudjee, Shahin Kamali","doi":"10.1109/ICDCS.2017.144","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.144","url":null,"abstract":"Server consolidation is the hosting of multiple tenantson a server machine. Given a sequence of data analyticstenant loads defined by the amount of resources that thetenants require and a service-level agreement (SLA) between thecustomer and the cloud service provider, significant cost savingscan be achieved by consolidating multiple tenants. Since servermachines can fail causing their tenants to become unavailable,service providers can place replicas of each tenant on multipleservers and reserve capacity to ensure that tenant failover willnot result in overload on any remaining server. We present theCubeFit algorithm for server consolidation that reduces costsby utilizing fewer servers than existing approaches for dataanalytics workloads. Unlike existing consolidation algorithms,CubeFit can tolerate multiple server failures while ensuring thatno server becomes overloaded. Through theoretical analysis andexperimental evaluation, we show that CubeFit is superior toexisting algorithms and produces near-optimal tenant allocationwhen the number of tenants is large. Through evaluation anddeployment on a cluster of 73 machines as well as throughsimulation studies, we experimentally demonstrate the efficacyof CubeFit.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116730827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Subscription Covering for Relevance-Based Filtering in Content-Based Publish/Subscribe Systems 基于内容的发布/订阅系统中基于相关性的过滤的订阅覆盖

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.184

Kaiwen Zhang, Vinod Muthusamy, Mohammad Sadoghi, H. Jacobsen

引用次数: 6

Local and Low-Cost White Space Detection 本地和低成本的空白空间检测

2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) Pub Date : 2017-06-01 DOI: 10.1109/ICDCS.2017.292

Ahmed Saeed, Khaled A. Harras, E. Zegura, M. Ammar

{"title":"Local and Low-Cost White Space Detection","authors":"Ahmed Saeed, Khaled A. Harras, E. Zegura, M. Ammar","doi":"10.1109/ICDCS.2017.292","DOIUrl":"https://doi.org/10.1109/ICDCS.2017.292","url":null,"abstract":"White spaces are portions of the TV spectrum that are allocated but not used locally. Ifaccurately detected, white spaces offer a valuable new opportunity for highspeed wireless communications. We propose a new method for white space detection that allows a node to actlocally, based on a centrally constructed model, and at low cost, whiledetecting more spectrum opportunities than best known approaches. Weleverage two ideas. First, we demonstrate that low-cost spectrum monitoringhardware can offer \"good enough\" detection capabilities. Second, we develop amodel that combines locally-measured signal features and location to more efficiently detect white space availability. We incorporate these ideas into the design,implementation, and evaluation of a complete system we call Waldo. We deployWaldo on a laptop in the Atlanta metropolitan area in the US covering 700 km2. Our results show that usingsignal features, in addition to location, can improve detection accuracy by up to10x for some channels. We also deploy Waldo on an Android smartphone,demonstrating the feasibility of real-time white space detection with efficientuse of smartphone resources.","PeriodicalId":127689,"journal":{"name":"2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124788298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 25