Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Location Awareness in Unstructured Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
Characterizing unstructured overlay topologies in modern P2P file-sharing systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
DCMP: A Distributed Cycle Minimization Protocol for Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
HPC5: An efficient topology generation mechanism for Gnutella networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
In this paper, we propose a completely distributed topology generation mechanism named HPC5 for Gnutella network. A Gnutella topology will be efficient and scalable if it generates less number of redundant queries and hence consists of lesser short length cycles. However, eliminating cycles totally, reduces the coverage of the peers in the network. Thus in the tradeoff between the cycle length and network coverage we have found that a minimum cycle length of 5 provides the minumum query redundancy with maximum network coverage. Thus our protocol directs each peer to select neighbors in such a way that any cyclic path present in the overlay network will have a minimum length of 5. We show that our approach can be deployed into the existing Gnutella network without disturbing any of its parameters. Simulation results signify that HPC5 is very effective for Gnutella's dynamic query search over limited flooding.