2009 29th IEEE International Conference on Distributed Computing Systems最新文献_第2页

Modeling Probabilistic Measurement Correlations for Problem Determination in Large-Scale Distributed Systems 大规模分布式系统中问题确定的概率度量关联建模

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.56

Jing Gao, Guofei Jiang, Haifeng Chen, Jiawei Han

{"title":"Modeling Probabilistic Measurement Correlations for Problem Determination in Large-Scale Distributed Systems","authors":"Jing Gao, Guofei Jiang, Haifeng Chen, Jiawei Han","doi":"10.1109/ICDCS.2009.56","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.56","url":null,"abstract":"With the growing complexity in computer systems, it has been a real challenge to detect and diagnose problems in today's large-scale distributed systems. Usually, the correlations between measurements collected across the distributed system contain rich information about the system behaviors, and thus a reasonable model to describe such correlations is crucially important in detecting and locating system problems. In this paper, we propose a transition probability model based on markov properties to characterize pair-wise measurement correlations. The proposed method can discover both the spatial (across system measurements) and temporal (across observation time) correlations, and thus such a model can successfully represent the system normal profiles. Problem determination and localization under this framework is fast and convenient. The framework is general enough to discover any types of correlations (e.g. linear or non-linear). Also, model updating, system problem detection and diagnosis can be conducted effectively and efficiently. Experimental results show that, the proposed method can detect the anomalous events and locate the problematic sources by analyzing the real monitoring data collected from three companies' infrastructures.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130983197","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}

引用次数: 38

CAP: A Context-Aware Privacy Protection System for Location-Based Services 基于位置的服务的上下文感知隐私保护系统

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/icdcs.2009.62

Aniket Pingley, Wei Yu, Nan Zhang, Xinwen Fu, Wei Zhao

{"title":"CAP: A Context-Aware Privacy Protection System for Location-Based Services","authors":"Aniket Pingley, Wei Yu, Nan Zhang, Xinwen Fu, Wei Zhao","doi":"10.1109/icdcs.2009.62","DOIUrl":"https://doi.org/10.1109/icdcs.2009.62","url":null,"abstract":"We address issues related to privacy protection in location-based services (LBS). Most existing research in this field either requires a trusted third-party (anonymizer) or uses oblivious protocols that are computationally and communicationally expensive. Our design of privacy-preserving techniques is principled on not requiring a trusted third-party while being highly efficient in terms of time and space complexities. The problem has two interesting and challenging characteristics: First, the degree of privacy protection and LBS accuracy depends on the context, such as population and road density, around a user's location. Second, an adversary may violate a user's location privacy in two ways: (i) based on the user's location information contained in the LBS query payload, and (ii) by inferring a user's geographical location based on its device's IP address. To address these challenges, we introduce CAP, a Context-Aware Privacy-preserving LBS system with integrated protection for data privacy and communication anonymity. We have implemented CAP and integrated it with Google Maps, a popular LBS system. Theoretical analysis and experimental results validate CAP's effectiveness on privacy protection, LBS accuracy, and communication Quality-of-Service.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126271612","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}

引用次数: 102

ISP Friend or Foe? Making P2P Live Streaming ISP-Aware ISP是敌是友?使P2P直播网络服务意识

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.37

Fabio Picconi, L. Massoulié

{"title":"ISP Friend or Foe? Making P2P Live Streaming ISP-Aware","authors":"Fabio Picconi, L. Massoulié","doi":"10.1109/ICDCS.2009.37","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.37","url":null,"abstract":"Current peer-to-peer systems are network-agnostic, often generating large volumes of unnecessary inter-ISP traffic. Although recent work has shown the benefits of ISP-awareness on bulk transfer applications, no studies have focused on optimizing P2P live streaming systems. These are harder to design, as data must be diffused to all receivers within short delays. In this paper we propose a novel scheme for ISP-friendly mesh-based live streaming. Each peer maintains two distinct sets of overlay neighbors, used respectively for local and global stream propagation. A dynamic unchoke mechanism minimizes inter-ISP traffic in normal operation, enabling it promptly when local diffusion is impaired, e.g., when fast local sources become suddenly unavailable. Our scheme is independent of the chunk scheduling algorithm, and thus can be applied to a wide range of existing systems. We have integrated our ISP-friendly scheme to our P2P live streaming prototype, and evaluated its performance through emulation and Planetlab experiments. Our results show that our scheme adapts quickly to churn and dynamic network conditions, and achieves up to a ten-fold reduction in transit traffic.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115283709","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}

引用次数: 67

CLIQUE: Role-Free Clustering with Q-Learning for Wireless Sensor Networks CLIQUE:无线传感器网络的无角色聚类与q -学习

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.43

Anna Förster, A. Murphy

引用次数: 57

Deterministic Replay for Transparent Recovery in Component-Oriented Middleware 面向组件中间件透明恢复的确定性重放

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.79

引用次数: 3

On the Utility of Inference Mechanisms 论推理机制的效用

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.51

E. Blanton, S. Fahmy, G. Frederickson

{"title":"On the Utility of Inference Mechanisms","authors":"E. Blanton, S. Fahmy, G. Frederickson","doi":"10.1109/ICDCS.2009.51","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.51","url":null,"abstract":"A number of network path delay, loss, or bandwidth inference mechanisms have been proposed over the past decade. Concurrently, several network measurement services have been deployed over the Internet and intranets. We consider inference mechanisms that use O(n) end-to-end measurements to predict the O(n^2) end-to-end pairwise measurements among n nodes, and investigate when it is beneficial to use them in measurement services. In particular, we address the following questions: (1) For which measurement request patterns would using an inference mechanism be advantageous? (2) How does a measurement service determine the set of hosts that should utilize inference mechanisms, as opposed to those that are better served using direct end-to-end measurements? (3) How can the answer to question 2 be efficiently computed as measurement requests arrive and terminate? Our solution is able to identify groups of hosts which are likely to benefit from inference, by utilizing a probabilistically generated spanning forest on the measurement request graph. We compare our solution to a simple heuristic that uses the number of measurements a host participates in. Results with synthetic datasets as well as datasets from a popular peer-to-peer system demonstrate that our technique identifies host subsets that benefit from inference quite accurately, and in significantly less time than an algorithm that identifies optimal subsets. The measurement savings are large when measurement request patterns exhibit small-world characteristics, which is often the case for peer-to-peer and other popular distributed systems.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125045497","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

Stochastic Multicast with Network Coding 基于网络编码的随机组播

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.29

A. Gopinathan, Zongpeng Li

{"title":"Stochastic Multicast with Network Coding","authors":"A. Gopinathan, Zongpeng Li","doi":"10.1109/ICDCS.2009.29","DOIUrl":"https://doi.org/10.1109/ICDCS.2009.29","url":null,"abstract":"The usage of network resources by content providers is commonly governed by Service Level Agreements (SLA) between the content provider and the network service provider. Resource usage exceeding the limits specified in the SLA incurs the content provider additional charges, usually at a higher cost. Hence, the content provider's goal is to provision adequate resources in the SLA based on forecasts of future demand. We study capacity purchasing strategies in this setting when the content provider employs network coded multicast as the data delivery mechanism. We model this problem as a two-stage stochastic optimization problem with recourse, and we design two approximation algorithms to solve such problems. The first is a heuristic that exploits properties unique to network coding. It performs well in general scenarios, but may be unbounded with respect to the optimal solution in the worst case. This motivates our second approach, a sampling algorithm partly inspired from the work of Gupta et al. [Gupta et al., ACM STOC 2004]. We employ techniques from duality theory in linear optimization to prove that sampling provides a 3-approximate solution to the stochastic multicast problem. We conduct simulations to illustrate the efficacy of both algorithms, and show that the performance of both is usually within 10% of the optimal solution in practice.","PeriodicalId":387968,"journal":{"name":"2009 29th IEEE International Conference on Distributed Computing Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122471637","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}

引用次数: 1

Networking the Cloud 云联网

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.86

A. Greenberg

引用次数: 10

The Digital Marauder's Map: A New Threat to Location Privacy 数字掠夺者地图:对位置隐私的新威胁

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.57

Xinwen Fu, Nan Zhang, Aniket Pingley, Wei Yu, Jie Wang, Wei Zhao

引用次数: 19

Protecting Neighbor Discovery Against Node Compromises in Sensor Networks 在传感器网络中保护邻居发现免受节点妥协

2009 29th IEEE International Conference on Distributed Computing Systems Pub Date : 2009-06-22 DOI: 10.1109/ICDCS.2009.10

Donggang Liu

引用次数: 21