The Case for a Hybrid P2P Search Infrastructure

  • Boon Thau Loo
  • Ryan Huebsch
  • Ion Stoica
  • Joseph M. Hellerstein
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3279)


Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based search techniques to locate files. While flooding-based techniques are effective for locating highly replicated items, they are poorly suited for locating rare items. As an alternative, a wide variety of structured P2P networks such as distributed hash tables (DHTs) have been recently proposed. Structured networks can efficiently locate rare items, but they incur significantly higher overheads than unstructured P2P networks for popular files. Through extensive measurements of the Gnutella network from multiple vantage points, we argue for a hybrid search solution, where structured search techniques are used to index and locate rare items, and flooding techniques are used for locating highly replicated content. To illustrate, we present experimental results of a prototype implementation that runs at multiple sites on PlanetLab and participates live on the Gnutella network.


Leaf Node Query Result Distribute Hash Table Popular Item Rare Item 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
  2. 2.
    Gnutella Proposals for Dynamic Querying,
  3. 3.
  4. 4.
  5. 5.
  6. 6.
  7. 7.
  8. 8.
    Balakrishnan, H., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Looking Up Data in P2P Systems. Communications of the ACM 46(2) (February 2003)Google Scholar
  9. 9.
    Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making Gnutella-like P2P Systems Scalable. In: Proceedings of ACM SIGCOMM 2003 (2003)Google Scholar
  10. 10.
    Gummadi, K.P., Dunn, R.J., Saroiu, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, Modeling and Analysis of a Peer-to-Peer File-Sharing Workload. In: Proceedings of the 19th ACM Symposium of Operating Systems Principles (SOSP-19), Bolton Landing, New York (October 2003)Google Scholar
  11. 11.
    Huebsch, R., Hellerstein, J.M., Lanham, N., Loo, B.T., Shenker, S., Stoica, I.: Querying the Internet with PIER. In: Proceedings of 19th International Conference on Very Large Databases (VLDB) (September 2003)Google Scholar
  12. 12.
    Li, J., Loo, B.T., Hellerstein, J., Kaashoek, F., Karger, D., Morris, R.: On the Feasibility of Peer-to-PeerWeb Indexing and Search. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Boon Thau Loo
    • 1
  • Ryan Huebsch
    • 1
  • Ion Stoica
    • 1
  • Joseph M. Hellerstein
    • 1
    • 2
  1. 1.UC BerkeleyBerkeleyUSA
  2. 2.Intel Research Berkeley 

Personalised recommendations