Skip to main content

Exploiting Content Localities for Efficient Search in P2P Systems

  • Conference paper
Distributed Computing (DISC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3274))

Included in the following conference series:

Abstract

Existing P2P search algorithms generally target either the performance objective of improving search quality from a client’s perspective, or the objective of reducing search cost from an Internet management perspective. We believe that the essential issue to be considered for designing and optimizing search algorithms in unstructured P2P networks is the trade-off between the two performance objectives. Motivated by our observations, the locality of content serving in the peer community and the localities of search interests of individual peers, we propose CAC-SPIRP, a fast and low cost P2P searching algorithm. Our algorithm consists of two components. The first component aims to reduce the search cost by constructing a CAC (Content Abundant Cluster), where content-abundant peers self-identify, and self-organize themselves into an inter-connected cluster providing a pool of popular objects to be frequently accessed by the peer community. A query will be first routed to the CAC, and most likely to be satisfied there, significantly reducing the amount of network traffic and the search scope. The second component in our algorithm is client oriented and aims to improve the quality of P2P search, called SPIRP (Selectively Prefetching Indices from Responding Peers). A client individually identifies a small group of peers who have the same interests as itself to prefetch their entire file indices of the related interests, minimizing unnecessary outgoing queries and significantly reducing query response time. Building SPIRP on the CAC Internet infrastructure, our algorithm combines both merits of the two components and balances the trade-off between the two performance objectives. Our trace-driven simulations show that CAC-SPIRP significantly improves the overall performance from both client’s perspective and Internet management perspective.

This work is supported in part by the U.S. National Science Foundation under grants CNS-0098055 and CCF-0129883.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adar, E., Huberman, B.: Free Riding on Gnutella. Technical Report, Xerox PARC (August 2000)

    Google Scholar 

  2. Bustamante, F., Qiao, Y.: Friendships that Last: Peer Lifespan and Its Role in P2P Protocols. In: Proceedings of WCW (2003)

    Google Scholar 

  3. Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making Gnutella-like P2P Systems Scalable. In: Proceedings of ACM SIGCOMM (2003)

    Google Scholar 

  4. Chu, J., Labonte, K., Levine, B.N.: Availability and locality measurement of peer-to-peer file systems. In: Proceedings of SPIE (2002)

    Google Scholar 

  5. Clip2 Distributed Search Solutions, http://www.clip2.com

  6. Gnutella, http://www.gnutella.com

  7. Jiang, S., Guo, L., Zhang, X.: LightFlood: an Efficient Flooding Scheme for File Search in Unstructured Peer-to-Peer System. In: Proceedings of ICPP (2003)

    Google Scholar 

  8. KaZaA, http://www.kazaa.com

  9. LimeWire, http://www.limewire.org

  10. LimeWire LLC, Ultrapeers: Another Step Towards Gnutella Scalability, http://www.limewire.com/developer/Ultrapeers.html

  11. Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proceedings of ICS (2002)

    Google Scholar 

  12. Morpheus, http://www.musiccity.com

  13. Saroiu, S., Gummadi, P.K., Gribble, S.D.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: Proceedings of MMCN (2002)

    Google Scholar 

  14. Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems. In: Proceedings of INFOCOM (2003)

    Google Scholar 

  15. Yang, B., Garcia-Molina, H.: Improving Search in Peer-to-Peer Networks. In: Proceedings of ICDCS (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guo, L., Jiang, S., Xiao, L., Zhang, X. (2004). Exploiting Content Localities for Efficient Search in P2P Systems. In: Guerraoui, R. (eds) Distributed Computing. DISC 2004. Lecture Notes in Computer Science, vol 3274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30186-8_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30186-8_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23306-0

  • Online ISBN: 978-3-540-30186-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics