Akshay K. Singh, Xu Cui, Benjamin Cassell, B. Wong, Khuzaima S. Daudjee
{"title":"MicroFuge: A Middleware Approach to Providing Performance Isolation in Cloud Storage Systems","authors":"Akshay K. Singh, Xu Cui, Benjamin Cassell, B. Wong, Khuzaima S. Daudjee","doi":"10.1109/ICDCS.2014.58","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.58","url":null,"abstract":"Most cloud providers improve resource utilization by having multiple tenants share the same resources. However, this comes at the cost of reduced isolation between tenants, which can lead to inconsistent and unpredictable performance. This performance variability is a significant impediment for tenants running services with strict latency deadlines. Providing predictable performance is particularly important for cloud storage systems. The storage system is the performance bottleneck for many cloud-based services and therefore often determines their overall performance characteristics. In this paper, we introduce MicroFuge, a new distributed caching and scheduling middleware that provides performance isolation for cloud storage systems. MicroFuge addresses the performance isolation problem by building an empirically-driven performance model of the underlying storage system based on measured data. Using this model, MicroFuge reduces deadline misses through adaptive deadline-aware cache eviction, scheduling and load-balancing policies. MicroFuge can also perform early rejection of requests that are unlikely to make their deadlines. Using workloads from the YCSB benchmark on an EC2 deployment, we show that adding MicroFuge to the storage stack substantially reduces the deadline miss rate of a distributed storage system compared to using a deadline oblivious distributed caching middleware such as Memcached.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124479816","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}
{"title":"Sim-Watchdog: Leveraging Temporal Similarity for Anomaly Detection in Dynamic Graphs","authors":"Guanhua Yan, S. Eidenbenz","doi":"10.1109/ICDCS.2014.24","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.24","url":null,"abstract":"Graphs are widely used to characterize relationships or information flows among entities in large networks or distributed systems. In this work, we propose a systematic framework that leverages temporal similarity inherent in dynamic graphs for anomaly detection. This framework relies on the Neyman-Pearson criterion to choose similarity measures with high discriminative power for online anomaly detection in dynamic graphs. We formulate the problem rigorously, and after establishing its inapproximibility result, we develop a greedy algorithm for similarity measure selection. We apply this framework to dynamic graphs generated from email communications among thousands of employees in a large research institution and demonstrate that it works effectively on a set of more than 100 candidate graph similarity measures.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124744480","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}
Raphaël Barazzutti, Thomas S. Heinze, André Martin, Emanuel Onica, P. Felber, C. Fetzer, Zbigniew Jerzak, Marcelo Pasin, E. Rivière
{"title":"Elastic Scaling of a High-Throughput Content-Based Publish/Subscribe Engine","authors":"Raphaël Barazzutti, Thomas S. Heinze, André Martin, Emanuel Onica, P. Felber, C. Fetzer, Zbigniew Jerzak, Marcelo Pasin, E. Rivière","doi":"10.1109/ICDCS.2014.64","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.64","url":null,"abstract":"Publish/subscribe (pub/sub) infrastructures running as a service on cloud environments offer simplicity and flexibility for composing distributed applications. Provisioning them appropriately is however challenging. The amount of stored subscriptions and incoming publications varies over time, and the computational cost depends on the nature of the applications and in particular on the filtering operation they require (e.g., content-based vs. topic-based, encrypted vs. non-encrypted filtering). The ability to elastically adapt the amount of resources required to sustain given throughput and delay requirements is key to achieving cost-effectiveness for a pub/sub service running in a cloud environment. In this paper, we present the design and evaluation of an elastic content-based pub/sub system: E-STREAMHUB. Specific contributions of this paper include: (1) a mechanism for dynamic scaling, both out and in, of stateful and stateless pub/sub operators, (2) a local and global elasticity policy enforcer maintaining high system utilization and stable end-to-end latencies, and (3) an evaluation using real-world tick workload from the Frankfurt Stock Exchange and encrypted content-based filtering.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125214818","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}
{"title":"Cooperative and Efficient Real-Time Scheduling for Automotive Communications","authors":"Yu Hua, Lei Rao, Xue Liu, D. Feng","doi":"10.1109/ICDCS.2014.22","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.22","url":null,"abstract":"FlexRay is an automotive network communication protocol. It provides support to transmit time-sensitive messages in automobiles. FlexRay transmits periodic messages in a static segment and a periodic messages in a dynamic segment. To improve transmission reliability, FlexRay offers hybrid data management schemes for both static and dynamic segments. However, existing approaches only schedule static segment and dynamic segment separately, leading to poor bandwidth utilization and transmission delay. Moreover, due to the bandwidth limitation, existing best-effort retransmission for all segments fails to achieve high reliability. To address these two concerns, we propose a novel and efficient scheduling scheme, called Coefficient. The idea behind Coefficient is to cooperatively schedule the static and dynamic segments, while judiciously stealing the selective slacks for reliable transmission based on practical fault models. Coefficient schedules both static and dynamic segments in the dual-channel manner based on practical fault models. Extensive experiments based on real-world case studies demonstrate that Coefficient meets the needs of both real-time transmission and reliability requirements, and delivers significant performance improvements.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116233314","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}
Cheng Li, Zhenjiang Li, Mo Li, F. Meggers, A. Schlueter, H. Lim
{"title":"Energy Efficient HVAC System with Distributed Sensing and Control","authors":"Cheng Li, Zhenjiang Li, Mo Li, F. Meggers, A. Schlueter, H. Lim","doi":"10.1109/ICDCS.2014.51","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.51","url":null,"abstract":"This paper presents our implementation experience in building an energy efficient HVAC system for cooling and air conditioning. The system exercises the \"low exergy\" theory and leverages high temperature water (18°C) cooling for better energy efficiency. In order to achieve this, the system decomposes the cooling and dehumidification functionalities, and employs decentralized air control for on-demand dehumidification and ventilation. The system comprises two control modules, namely, radiant cooling module and distributed ventilation module, cooperating with each other to provide the HVAC control. Abundant sensors and embedded control devices are customized and instrumented, and we develop a wireless sensor network to support control data exchange among those devices. Our experimental evaluation demonstrates that the system achieves accurate control targets and promptly responses to environment dynamics. The wireless sensor network effectively supports the system needs with long system lifespan. Compared with traditional HVAC systems, our system is of much higher energy efficiency, as measured by the standard Coefficient of Performance (COP) metric.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124424662","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}
{"title":"On Limits of Travel Time Predictions: Insights from a New York City Case Study","authors":"R. Ganti, M. Srivatsa, T. Abdelzaher","doi":"10.1109/ICDCS.2014.25","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.25","url":null,"abstract":"The proliferation of location sensors has resulted in the wide availability of historical location and time data. A prominent use of such data is to develop models to estimate travel-times (between arbitrary points in a city) accurately. The problem of travel-time estimation/prediction has been well studied in the past, where the proposed techniques span a spectrum of statistical methods, such as k-nearest neighbors, Gaussian regression, Artificial Neural Networks, and Support Vector Machines. In this paper, we demonstrate that, contrary to popular intuition, empirical data suggests that simple travel time predictors come very close to the fundamental error bounds achievable in delay prediction. We derive such bounds by estimating entropy that remains in travel time distributions, even after all spatio-temporal delay-influencing factors have been accounted for. Our results are based on analysis of cab traces from New York City, that feature 15 million trips. While we cannot claim generalizability to other cities, the results suggest the diminishing return of complex travel-time predictors due to the inherent nature of uncertainty in trip delays. We demonstrate a simple travel-time predictor, whose error approaches the uncertainty bound. It predicts delay based only on total distance traveled and time-of-day and is close to the optimal solution.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132182204","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}
Yong Fu, M. Sha, Chengjie Wu, A. Kutta, A. Leavey, Chenyang Lu, Humberto González, Weining Wang, B. Drake, Yixin Chen, P. Biswas
{"title":"Thermal Modeling for a HVAC Controlled Real-Life Auditorium","authors":"Yong Fu, M. Sha, Chengjie Wu, A. Kutta, A. Leavey, Chenyang Lu, Humberto González, Weining Wang, B. Drake, Yixin Chen, P. Biswas","doi":"10.1109/ICDCS.2014.16","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.16","url":null,"abstract":"The largest source of energy consumption in buildings is heating, ventilation, and air conditioning (HVAC). For an HVAC system to provide comfort and minimize energy consumption, it is crucial to understand the spatiotemporal thermal dynamics, especially in large open spaces. To optimize HVAC control, it is important to establish accurate dynamic thermal models. For this purpose, we constructed a real-world test bed by instrumenting an HVAC-controller auditorium using multiple types of sensors. Based on the dataset, we develop and evaluate a novel data-driven approach to model the complex thermal dynamics in a large space through a combination of data clustering and system identification techniques. Real-world data shows that our approach achieves low estimation errors. Our modeling approach therefore provides a practical foundation for HVAC control and optimization for large open spaces.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133329575","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}
{"title":"Providing Efficient Privacy-Aware Incentives for Mobile Sensing","authors":"Qinghua Li, G. Cao","doi":"10.1109/ICDCS.2014.29","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.29","url":null,"abstract":"Mobile sensing relies on data contributed by users through their mobile device (e.g., smart phone) to obtain useful information about people and their surroundings. However, users may not want to contribute due to lack of incentives and concerns on possible privacy leakage. To effectively promote user participation, both incentive and privacy issues should be addressed. Existing work on privacy-aware incentive is limited to special scenario of mobile sensing where each sensing task needs only one data report from each user, and thus not appropriate for generic scenarios in which sensing tasks may require multiple reports from each user (e.g., in environmental monitoring applications). In this paper, we propose a privacy-aware incentive scheme for general mobile sensing, which allows each sensing task to collect one or multiple reports from each user as needed. Besides being more flexible in task management, our scheme has much lower computation and communication cost compared to the existing solution. Evaluations show that, when each node only contributes data for a small fraction of sensing tasks (e.g, due to the incapability or disqualification to generate sensing data for other tasks), our scheme runs at least one order of magnitude faster.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114354328","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}
{"title":"An Interest-Based Per-Community P2P Hierarchical Structure for Short Video Sharing in the YouTube Social Network","authors":"Haiying Shen, Yuhua Lin, Harrison Chandler","doi":"10.1109/ICDCS.2014.38","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.38","url":null,"abstract":"The past few years have seen an explosion in the popularity of online short-video sharing in You Tube. As the number of users continued to grow, the bandwidth required to maintain acceptable quality of service (QoS) has greatly increased. Peer-to-peer (P2P) architectures have shown promise in reducing the bandwidth costs, however, the previous works build one P2P overlay for each video, which provides limited availability of video providers and produces high overlay maintenance overhead. To handle these problems, in this work, we novelly leverage the existing social network in You Tube, where a user subscribes to another user's channel to track all his uploaded videos. The subscribers of a channel tend to watch the channel's videos and common-interest nodes tend to watch the same videos. Also, the popularity of videos in one channel varies greatly. We study real trace data to confirm these properties. Based on these properties, we propose Social Tube that builds the subscribers of one channel into a P2P overlay and also clusters common-interest nodes in a higher level. It also incorporates a prefetching algorithm that prefetches higher-popularity videos. Extensive trace-driven simulation results and Planet Lab real world experimental results verify the effectiveness of Social Tube at reducing server load and overlay maintenance overhead and at improving QoS for users.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"118 41","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120827445","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}
Zhi Zhou, Fangming Liu, Bo Li, Baochun Li, Hai Jin, Ruolan Zou, Zhiyong Liu
{"title":"Fuel Cell Generation in Geo-Distributed Cloud Services: A Quantitative Study","authors":"Zhi Zhou, Fangming Liu, Bo Li, Baochun Li, Hai Jin, Ruolan Zou, Zhiyong Liu","doi":"10.1109/ICDCS.2014.14","DOIUrl":"https://doi.org/10.1109/ICDCS.2014.14","url":null,"abstract":"The demand for capping carbon emission has promoted the use of fuel cell energy in cloud computing, yet it is unclear what and how much benefit it may bring. This paper, for the first time, attempts to quantitatively examine the benefits brought by fuel cell generation, and to illustrate how such benefits can be realized with an intelligent coordination between grid power and fuel cell generation. Specifically, we propose UFC, a quantitative index called the utility of the cloud using fuel cells, which captures the level of the data enters operator's overall satisfaction from energy cost, carbon emission, and workload performance. We formulate the UFC maximization problem to jointly optimize both fuel cell generation and geographical request routing. In order to avoid centralized solutions with high complexity and low scalability, we develop a distributed algorithm blending the advantages of Alternating Direction Method of Multipliers (ADMM) and the auxiliary variable method, whose performance is evaluated and verified through our extensive simulations based on real-world data enter workload traces, electricity prices and generation data sets.","PeriodicalId":170186,"journal":{"name":"2014 IEEE 34th International Conference on Distributed Computing Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121138161","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}