Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
IEEE Internet Computing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Hi-index | 0.01 |
Random walks is an excellent search mechanism in unstructured P2P network. However, it generates long delay and makes some resources indiscoverable, especially for uncommon files. File replication strategy can improve the performance of random walks. But it has high overhead. An efficient replication strategy LQPD is presented. In LQPD, file replication operation is triggered only when the length of query path exceeds user-acceptable delay. Experimental results show LQPD can get better performance than other strategies with the same number of file replicas in a Gnutella-like overlay network.