Search in unstructured Peer-to-Peer networks

N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Unstructured Peer-to-Peer (hence P2P) applications, such as KaZaa, Gnutella, etc. are very popular on the Internet over the last few years. Search method is a major component of these distributed systems and its efficiency also does influence the systems performance. An efficient technique for improving performance of search method is to replicate file location information in P2P networks. Unstructured P2P topology has power-law characteristic in the link distribution, so we present a replica spread mechanism utilizing high degree nodes in this paper. Based on this spread mechanism, we proposed two search methods. Extensive simulation results show that they performs very well on the power-law networks, achieve high success rates, and are robust to node failure. © Springer-Verlag; 2004.

Cite

CITATION STYLE

APA

Jia, Z., Tang, X., You, J., & Li, M. (2004). Search in unstructured Peer-to-Peer networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3306, 694–705. https://doi.org/10.1007/978-3-540-30480-7_72

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free