Abstract
This paper is motivated by the problem of poor searching efficiency in decentralized peer-to-peer file-sharing systems. We solve the searching problem by considering and modeling the basic trade-off between forwarding queries among peers and maintaining lookup tables in peers, so that we can utilize optimized lookup table scale to minimize bandwidth consumption, and to greatly improve the searching performance under arbitrary system parameters and resource constraints (mainly the available bandwidth). Based on the model, we design a decentralized peer-to-peer searching strategy, namely the Lookup-ring, which provides very efficient keyword searching in high dynamic peer-to-peer environments. The simulation results show that Lookup-ring can easily support a large-scale system with more than 106 participating peers at a very small cost in each peer.
Supported by NSFC under Grant No. 60373004, No. 60373005, and 973 project numbered 2003CB3169007
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Napster, the napster homepage, http://www.napster.com/
Gnutella, http://www.gnutella.com
KaZaA, file sharing network, http://www.kazaa.com
Cohen, E., Fiat, A., Kaplan, H.: Associative Search in Peer to Peer Networks: Harnessing Latent Semantics. In: Proceedings of the IEEE INFOCOM 2003 Conference (2003)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proceedings of 16th ACM International Conference on Supercomputing, ICS 2002 (2002)
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making Gnutella-like P2P Systems Scalable. In: Proceeding of ACM Sigcomm 2003 (2003)
Saroiu, S., Gummadi, P.K., Gribble, S.D.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: Proceedings of Multimedia Computing and Networking 2002 (MMCN 2002), CA (January 2002)
Chu, J., Labonte, K., Levine, B.: Availability and locality measurements of peer-to-peer file systems. In: Proceedings of ITCom: Scalability and Traffic Control in IP Networks (July 2002)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: IFIP/ACM Middleware (November 2001)
Wang, J.: Gnutella bandwidth usage (November 2001), https://resnet.utexas.edu/trouble/p2p-gnutella.html
Bhattacharjee, B., et al.: Efficient Peer-To-Peer Searches Using Result-Caching. In: IPTPS 2003 (2003)
Liu, X.Z., Hu, J.F., Wang, D.X.: Lookup-Rings: Building Efficient Lookups for High Dynamic Peer-to-peer Overlays, http://166.Ill.68.com/granary/index.htm
Cohen, E., Shenker, S.: Replication strategies in unstructured Peer-to-Peer networks. In: Proceedings of the ACM SIGCOMM 2002 Conference (2002)
Gupta, A., Liskov, B., Rodrigues, R.: One Hop Lookups for Peer-to-Peer Overlays. In: HotOS IX (2003)
Gupta, I., Birman, K., Linga, P., Demers, A., van, R., Kelips, R.: Building an efficient and stable P2P DHT through increased memory and background overhead. In: IPTPS (2003)
El-Ansary, S., Alima, L., Brand, P., Haridi, S.: Efficient broadcast in structured P2P networks. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)
Harren, M., Hellerstein, J.M., Huebsch, R.: Complex queries in DHT-based P2P Networks. In: IPTPS 2001 (2001)
Wang, J.: Gnutella bandwidth usage (November 2001), https://resnet.utexas.edu/trouble/p2p-gnutella.html
Ge, Z., Figueiredo, D.R., Jaiswal, S., Kurose, J., Towsley, D.: Modeling Peer-Peer File Sharing Systems. In: Proceedings of IEEE INFOCOM 2003 (2003)
Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: SkipNet: A Scalable Overlay Network with Practical Locality Properties. In: Proceedings of 4th USITS (March 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 IFIP International Federation for Information Processing
About this paper
Cite this paper
Liu, X., Yang, G., Hu, J., Chen, M., Wu, Y. (2004). Lookup-Ring: Building Efficient Lookups for High Dynamic Peer-to-Peer Overlays. In: Jin, H., Gao, G.R., Xu, Z., Chen, H. (eds) Network and Parallel Computing. NPC 2004. Lecture Notes in Computer Science, vol 3222. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30141-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-30141-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23388-6
Online ISBN: 978-3-540-30141-7
eBook Packages: Springer Book Archive