Sampling Cluster Endurance for Peer-to-Peer based Content Distribution Networks
Key: DMS06-1
Author: Vasilios Darlagiannis, Andreas Mauthe, Ralf Steinmetz
Date: January 2006
Kind: In proceedings
Book title: Proceedings of Multimedia Computing and Networking (MMCN'06)
Keywords: Sampling mechanisms, Overlay networks, Peer-to-Peer systems, Stability
Abstract: Several types of Content Distribution Networks are being deployed over the Internet today, based on di®erent architectures to meet their requirements (e.g., scalability, e±ciency and resiliency). Peer-to-Peer (P2P) based Content Distribution Networks are promising approaches that have several advantages. Structured P2P net- works, for instance, take a proactive approach and provide e±cient routing mechanisms. Nevertheless, their maintenance can increase considerably in highly dynamic P2P environments. In order to address this issue, a two-tier architecture that combines a structured overlay network with a clustering mechanism is suggested in a hybrid scheme. <p> In this paper, we examine several sampling algorithms utilized in the aforementioned hybrid network that collect local information in order to apply a selective join procedure. The algorithms are based mostly on random walks inside the overlay network. The aim of the selective join procedure is to provide a well balanced and stable overlay infrastructure that can easily overcome the unreliable behavior of the autonomous peers that constitute the network. The sampling algorithms are evaluated using simulation experiments where several properties related to the graph structure are revealed. </p>
View Full paper (PDF) | Download Full paper (PDF)

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.