27th International Conference on Distributed Computing Systems (ICDCS '07)最新文献_第4页

Optimizing Multicast Performance in Large-Scale WLANs 大规模无线局域网中的组播性能优化

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.125

Ai Chen, Dongwook Lee, P. Sinha

引用次数: 20

A Virtual Node-Based Tracking Algorithm for Mobile Networks 基于虚拟节点的移动网络跟踪算法

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.82

Tina Nolte, N. Lynch

引用次数: 24

Asymptotic Connectivity in Wireless Networks Using Directional Antennas 使用定向天线的无线网络的渐近连通性

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.85

Pan Li, Chi Zhang, Yuguang Fang

引用次数: 5

Characterizing Network Traffic in a Cluster-based, Multi-tier Data Center 在基于集群的多层数据中心中描述网络流量

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.90

D. Ersoz, Mazin S. Yousif, C. Das

{"title":"Characterizing Network Traffic in a Cluster-based, Multi-tier Data Center","authors":"D. Ersoz, Mazin S. Yousif, C. Das","doi":"10.1109/ICDCS.2007.90","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.90","url":null,"abstract":"With the increasing use of various Web-based services, design of high performance, scalable and dependable data centers has become a critical issue. Recent studies show that a clustered, multi-tier architecture is a cost-effective approach to design such servers. Since these servers are highly distributed and complex, understanding the workloads driving them is crucial for the success of the ongoing research to improve them. In view of this, there has been a significant amount of work to characterize the workloads of Web-based services. However, all of the previous studies focus on a high level view of these servers, and analyze request-based or session-based characteristics of the workloads. In this paper, we focus on the characteristics of the network behavior within a clustered, multi-tiered data center. Using a real implementation of a clustered three-tier data center, we analyze the arrival rate and inter-arrival time distribution of the requests to individual server nodes, the network traffic between tiers, and the average size of messages exchanged between tiers. The main results of this study are; (1) in most cases, the request inter-arrival rates follow log-normal distribution, and self-similarity exists when the data center is heavily loaded, (2) message sizes can be modeled by the log-normal distribution, and (3) service times fit reasonably well with the Pareto distribution and show heavy tailed behavior at heavy loads.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115680066","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}

引用次数: 117

Optimizing Peer Relationships in a Super-Peer Network 超级对等网络中对等关系的优化

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.126

P. Garbacki, D. Epema, M. Steen

{"title":"Optimizing Peer Relationships in a Super-Peer Network","authors":"P. Garbacki, D. Epema, M. Steen","doi":"10.1109/ICDCS.2007.126","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.126","url":null,"abstract":"Super-peer architectures exploit the heterogeneity of nodes in a P2P network by assigning additional responsibilities to higher-capacity nodes. In the design of a super-peer network for file sharing, several issues have to be addressed: how client peers are related to super-peers, how super-peers locate files, how the load is balanced among the super-peers, and how the system deals with node failures. In this paper we introduce a self-organizing super-peer network architecture (SOSPNET) that solves these issues in a fully decentralized manner. SOSPNET maintains a super-peer network topology that reflects the semantic similarity of peers sharing content interests. Super-peers maintain semantic caches of pointers to files which are requested by peers with similar interests. Client peers, on the other hand, dynamically select super-peers offering the best search performance. We show how this simple approach can be employed not only to optimize searching, but also to solve generally difficult problems encountered in P2P architectures such as load balancing and fault tolerance. We evaluate SOSPNET using a model of the semantic structure derived from the 8-month traces of two large file-sharing communities. The obtained results indicate that SOSPNET achieves close-to-optimal file search performance, quickly adjusts to changes in the environment (node joins and leaves), survives even catastrophic node failures, and efficiently distributes the system load taking into account peer capacities.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126259006","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}

引用次数: 56

Magellan: Charting Large-Scale Peer-to-Peer Live Streaming Topologies 麦哲伦:绘制大规模点对点直播拓扑

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.118

Chuan Wu, Baochun Li, Shuqiao Zhao

{"title":"Magellan: Charting Large-Scale Peer-to-Peer Live Streaming Topologies","authors":"Chuan Wu, Baochun Li, Shuqiao Zhao","doi":"10.1109/ICDCS.2007.118","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.118","url":null,"abstract":"Live peer-to-peer (P2P) streaming applications have been successfully deployed in the Internet. With relatively simple peer selection protocol design, modern live P2P streaming applications are able to provide millions of concurrent users adequately satisfying viewing experiences. That said, few existing research has provided sufficient insights on the time-varying internal characteristics of P2P topologies in live streaming. With 120 GB worth of traces in late 2006 from a commercial P2P live streaming system of UUSee Inc. in Beijing, this paper represents the first attempt in the research community to explore topological properties in practical P2P streaming, and how they behave over time. Starting from classical graph metrics, such as degree, clustering coefficient, and reciprocity, we explore and extend them in specific perspectives of streaming applications. We also compare our findings with existing insights from topological studies of P2P file sharing applications, which shed new and unique insights specific to streaming. Our characterization reveals the scalability of the commercial P2P streaming application even in case of large flash crowds, the clustering phenomenon of peers in each ISP, as well as the reciprocal behavior among peers, all of which play important roles in achieving its current success.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126592925","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}

引用次数: 65

Combating Double-Spending Using Cooperative P2P Systems 利用协作式P2P系统打击双重消费

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.91

Ivan Osipkov, Eugene Y. Vasserman, Nicholas Hopper, Yongdae Kim

引用次数: 43

A Multiphased Approach for Modeling and Analysis of the BitTorrent Protocol BitTorrent协议建模与分析的多阶段方法

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.81

Vivek Rai, S. Sivasubramanian, S. Bhulai, P. Garbacki, M. Steen

引用次数: 22

Conflict Managers for Self-stabilization without Fairness Assumption 无公平假设的自稳定冲突管理

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.95

M. Potop-Butucaru, S. Tixeuil

{"title":"Conflict Managers for Self-stabilization without Fairness Assumption","authors":"M. Potop-Butucaru, S. Tixeuil","doi":"10.1109/ICDCS.2007.95","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.95","url":null,"abstract":"In this paper, we specify the conflict manager abstraction. Informally, a conflict manager guarantees that any two nodes that are in conflict cannot enter their critical section simultaneously (safety), and that at least one node is able to execute its critical section (progress). The conflict manager problem is strictly weaker than the classical local mutual exclusion problem, where any node that requests to enter its critical section eventually does so (fairness). We argue that conflict managers are a useful mechanism to transform a large class of self-stabilizing algorithms that operate in an essentially sequential model, into self-stabilizing algorithm that operate in a completely asynchronous distributed model. We provide two implementations (one deterministic and one probabilistic) of our abstraction, and provide a composition mechanism to obtain a generic transformer. Our transformers have low overhead: the deterministic transformer requires one memory bit, and guarantees time overhead in order of the network degree, the probabilistic transformer does not require extra memory. While the probabilistic algorithm performs in anonymous networks, it only provides probabilistic stabilization guarantees. In contrast, the deterministic transformer requires initial symmetry breaking but preserves the original algorithm guarantees.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132290019","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}

引用次数: 52

LagOver: Latency Gradated Overlays LagOver:延迟渐变叠加

27th International Conference on Distributed Computing Systems (ICDCS '07) Pub Date : 2007-06-25 DOI: 10.1109/ICDCS.2007.116

Anwitaman Datta, I. Stoica, M. Franklin

{"title":"LagOver: Latency Gradated Overlays","authors":"Anwitaman Datta, I. Stoica, M. Franklin","doi":"10.1109/ICDCS.2007.116","DOIUrl":"https://doi.org/10.1109/ICDCS.2007.116","url":null,"abstract":"We propose a new genre of overlay network for disseminating information from popular but resource constrained sources. We call this communication primitive as latency gradated overlay, where information consumers self- organize themselves according to their individual resource constraints and the latency they are willing to tolerate in receiving the information from the source. Such a communication primitive finds immediate use in applications like RSS feeds aggregation. We propose heuristic algorithms to construct LagOver based on preferably some partial knowledge of the network at users (no knowledge slows the construction process) but no global coordination. The algorithms are evaluated based on simulations and show good characteristics including convergence, satisfying peers' latency and bandwidth constraints even in presence of moderately high membership dynamics. There are two points worth noting. First, optimizing jointly for latency and capacity (i.e., placing nodes that have free capacity close to the source) as long as latency constraint of other nodes are not violated performs better than optimizing for latency only. The joint optimization strategy has faster convergence of the LagOver network, and can deal with adversarial workloads that optimization of only latency can not deal with. Secondly, somewhat counter-intuitively, in order to do the aforementioned joint optimization, it is sufficient to find random nodes based on only the latency constraint, since even if the capacity of individual nodes is saturated it does not matter since the LagOver network can potentially be reconfigured.","PeriodicalId":170317,"journal":{"name":"27th International Conference on Distributed Computing Systems (ICDCS '07)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114526007","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}

引用次数: 26