Darlagiannis, Vasilios; and Mauthe, Andreas; and Steinmetz, Ralf (2007) Sampling Cluster Endurance for Peer-to-Peer based Content Distribution Networks. Multimedia Systems, 13 (1). pp. 19-33. ISSN 1432-1882Full text not available from this repository.
Several types of Content Distribution Networks are being deployed over the Internet today, based on different architectures to meet their requirements (e.g., scalability, efficiency and resiliency). Peer-to-peer (P2P) based Content Distribution Networks are promising approaches that have several advantages. Structured P2P networks, for instance, take a proactive approach and provide efficient routing mechanisms. Nevertheless, their maintenance can increase considerably in highly dynamic P2P environments. In order to address this issue, a two-tier architecture called Omicron that combines a structured overlay network with a clustering mechanism is suggested in a hybrid scheme. 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. Additionally, we apply the sampling algorithms on Chord in order to evaluate sampling as a general information gathering mechanism. The algorithms are based mostly on random walks inside the overlay networks. 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 as well as probabilistic analysis where several properties related to the graph structure are revealed.
|Journal or Publication Title:||Multimedia Systems|
|Additional Information:||This paper examines sampling algorithms based on local information gathering used to apply a selective join procedure in hyprid P2P based content distribution networks. The algorithms are mostly based 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 behaviour of autonomous peers that constitute the network. An earlier version of the paper received the best student paper award at MMCN2006 (ACM Multimedia and SPIE related). This version is an extended version reflecting the importance of the contribution. RAE_import_type : Journal article RAE_uoa_type : Computer Science and Informatics|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Departments:||Faculty of Science and Technology > School of Computing & Communications|
|Deposited On:||26 Jun 2008 16:38|
|Last Modified:||02 Dec 2016 01:28|
Actions (login required)