Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2008-06-14
Computer Science
Distributed, Parallel, and Cluster Computing
10 pages, 6 figures, 43 references. Proceedings of The 8th IEEE International Conference on Peer-to-Peer Computing 2008 (IEEE
Scientific paper
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the churn caused by the ad-hoc nodes joining or leaving the network. Preserving the structure becomes more prohibitive due to the distributed and potentially uncooperative nature of such networks, as in the peer-to-peer (P2P) networks. Thus, most practical solutions involve unstructured approaches while attempting to maintain the structure at various levels of protocol stack. The primary focus of this paper is to investigate construction and maintenance of scale-free topologies in a distributed manner without requiring global topology information at the time when nodes join or leave. We consider the uncooperative behavior of peers by limiting the number of neighbors to a pre-defined hard cutoff value (i.e., no peer is a major hub), and the ad-hoc behavior of peers by rewiring the neighbors of nodes leaving the network. We also investigate the effect of these hard cutoffs and rewiring of ad-hoc nodes on the P2P search efficiency.
Guclu Hasan
Kumari Durgesh
Yuksel Murat
No associations
LandOfFree
Ad-hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Ad-hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ad-hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-495548