Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proceedings of the annual ACM International Conference on supercomputing, vol. 16 (2002)
Gkantsidis, C., Mihail, M., Saberi, A.: random walks in peer-to-peer networks. In: Proceedings of Infocom 2004 (2004)
Tsoumakos, D., Roussopoulos, N.: Adaptive probabilistic search for peer-to-peer networks. In: 3rd IEEE Intl Conference on P2P computing (2003)
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like p2p systems scalable. In: SIGCOMM (2003)
Adar, E., Huberman, B.A.: Free riding on gnutella. Technical report, Xerox PARC (2000)
Clarke, I., Sandberg, O.: Freenet: A distributed anonymous information storage and retrieval system. In: Proceedings of the ICSI Workshop On Design Issues in Anonymity and Unobservability (2002)
Cohen, E., Shenker, S.: Replication strategies in unstructured peer-to-peer networks. In: ACM SIGCOMM (2002)
Markatos, E.: Tracing a large-scale peer to peer system an hour in the life of gnutella. In: Proceedings of IEEE/ACM International Symposium on Cluster Computing and the Grid (2002)
Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Computing Journal 6(1) (2002)
Jovanovic, M., Annexstein, F.S., Berman, K.A.: Modeling peer-to-peer network topologies through small-world models and power laws. In: Proceedings of the TELFOR (2001)
DSS, C.: Gnutella: To the bandwidth barrier and beyond. Technical report (2000), http://dss.clip2.com
Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 509 (1999)
Dreier, D.: Manual of operation: Barabasi graph generator v1.0. Web Pages (2002), http://www.cs.ucr.edu/ddreier/bman.pdf
Sripanidkulchai, K.: The popularity of gnutella queries and its implications on scalability. In: O’Reilly’s (2001), http://www.openp2p.com
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, X., Zheng, Q., Zhu, P., Peng, W. (2005). LQPD: An Efficient Long Query Path Driven Replication Strategy in Unstructured P2P Network. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31957-3_89
Download citation
DOI: https://doi.org/10.1007/978-3-540-31957-3_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25338-9
Online ISBN: 978-3-540-31957-3
eBook Packages: Computer ScienceComputer Science (R0)