A comparison of spread methods in unstructured p2p networks

Authors:
Zhaoqing Jia;Bingzhen Pei;Minglu Li;Jinyuan You
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai, China
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Year:
2005

Citing 3
Cited 0

Search and replication in unstructured peer-to-peer networks

ICS '02 Proceedings of the 16th international conference on Supercomputing
Probabilistic scalable P2P resource location services

ACM SIGMETRICS Performance Evaluation Review
Replication strategies in unstructured peer-to-peer networks

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, unstructured Peer-to-Peer (P2P) applications are very popular on the Internet. Unstructured P2P topology has power-law characteristic in the link distribution, containing a few nodes that have a very high degree and many with low degree. This reflects the presence of central nodes which interact with many others and play a key role in relaying information. The system performance can be improved by replicating file location information to the high degree nodes in unstructured P2P. In this paper, we present an overview of several spread mechanisms for unstructured P2P and analyze the performance of them relative to the number of information replica and the bandwidth consumption. The optimal spread mechanism is high degree spread method. Simulation results empirically evaluate their behavior in direct comparison and verify our analysis.