Advertisement

Unstructured Peer-to-Peer Networks: Topological Properties and Search Performance

  • George H. L. Fletcher
  • Hardik A. Sheth
  • Katy Börner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3601)

Abstract

Performing efficient decentralized search is a fundamental problem in Peer-to-Peer (P2P) systems. There has been a significant amount of research recently on developing robust self-organizing P2P topologies that support efficient search. In this paper we discuss four structured and unstructured P2P models (CAN, Chord, PRU, and Hypergrid) and three characteristic search algorithms (BFS, k-Random Walk, and GAPS) for unstructured networks. We report on the results of simulations of these networks and provide measurements of search performance, focusing on search in unstructured networks. We find that the proposed models produce small-world networks, and yet none exhibit power-law degree distributions. Our simulations also suggest that random graphs support decentralized search more effectively than the proposed unstructured P2P models. We also find that on these topologies, the basic breadth-first search algorithm and its simple variants have the lowest search cost.

Keywords

Search Algorithm Network Size Random Graph Degree Distribution Topological Property 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adamic, L., Lukose, R., Puniyani, A., Huberman, B.: Search in Power-Law Networks. Physical Review E 64(4), 46135–46143 (2001)CrossRefGoogle Scholar
  2. 2.
    Akavipat, R., Wu, L.-S., Menczer, F.: Small World Peer Networks in Distributed Web Search. In: Proc. ACM WWW 2004, pp. 396–397 (2004)Google Scholar
  3. 3.
    Albert, R., Barabási, A.-L.: Statistical Mechanics of Complex Networks. Reviews of Modern Physics 74(1), 47–97 (2002)CrossRefMathSciNetzbMATHGoogle Scholar
  4. 4.
    Babaoğlu, Ö., Meling, H., Montresor, A.: Anthill: A Framework for the Development of Agent-Based Peer-to-Peer Systems. In: Proc. IEEE ICDCS 2002, pp. 15–22 (2002)Google Scholar
  5. 5.
    Banaei-Kashani, F., Shahabi, C.: Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as Complex Systems. In: Proc. IEEE/ACM CCGRID 2003, pp. 351–358 (2003)Google Scholar
  6. 6.
    Batagelj, V., Mrvar, A.: Pajek: Package for Large Network Analysis, http://vlado.fmf.uni-lj.si/pub/networks/pajek/
  7. 7.
    Borgatti, S.P., Everett, M.G., Freeman, L.C.: Ucinet for Windows: Software for Social Network Analysis. Analytic Technologies, Harvard (2002)Google Scholar
  8. 8.
    Decker, K., Sycara, K., Williamson, M.: Middle-Agents for the Internet. In: Proc. IJCAI 1997, pp. 578–583 (1997)Google Scholar
  9. 9.
    Dimakopoulos, V.V., Pitoura, E.: A Peer-to-Peer Approach to Resource Discovery in Multi-Agent Systems. In: Klusch, M., Omicini, A., Ossowski, S., Laamanen, H. (eds.) CIA 2003. LNCS (LNAI), vol. 2782, pp. 62–77. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-Law Relationships of the Internet Topology. In: Proc. ACM SIGCOMM, pp. 251–262 (1999)Google Scholar
  11. 11.
    Jovanović, M., Annexstein, F., Berman, K.: Modeling Peer-to-Peer Network Topologies Through Small-World Models and Power Laws. In: IX Telecommunications Forum TELFOR (2001)Google Scholar
  12. 12.
    Kalogeraki, V., Gunopulosand, D., Zeinalipour-Yazti, D.: A Local Search Mechanism for Peer-to-Peer Networks. In: Proc. ACM CIKM 2002, November 2002, pp. 300–307 (2002)Google Scholar
  13. 13.
    Kleinberg, J.: Navigation in a Small World. Nature 406(845) (August 2000)Google Scholar
  14. 14.
    Koubarakis, M.: Multi-Agent Systems and Peer-to-Peer Computing: Methods, Systems and Challenges. In: Klusch, M., Omicini, A., Ossowski, S., Laamanen, H. (eds.) CIA 2003. LNCS (LNAI), vol. 2782, pp. 46–61. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  15. 15.
    Lv, Q., et al.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proc. ACM ICS 2002, pp. 84–95 (2002)Google Scholar
  16. 16.
    Minar, N., Burkhart, R., Langton, C., Askenazi, M.: The Swarm Simulation System, A Toolkit for Building Multi-Agent Simulations. Technical Report, Swarm Development Group (June 1996)Google Scholar
  17. 17.
    Milojičić, D.S., et al.: Peer-to-Peer Computing. HP Labs Technical Report HPL-2002-57 (2002)Google Scholar
  18. 18.
    Newman, M.E.J.: The Structure and Function of Complex Networks. SIAM Review 45(2), 167–256 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Pandurangan, G., Raghavan, P., Upfal, E.: Building Low-Diameter Peer-to-Peer Networks. IEEE J. Select. Areas Commun. 21(6), 995–1002 (2003)CrossRefGoogle Scholar
  20. 20.
    Ratnasamy, S., et al.: A Scalable Content-Addressable Network. In: Proc. ACM SIGCOMM, August 2001, pp. 161–172 (2001)Google Scholar
  21. 21.
    Saffre, F., Ghanea-Hercock, R.: Beyond Anarchy: Self Organized Topology for Peer-to-Peer Networks. Complexity 9(2), 49–53 (2003)CrossRefGoogle Scholar
  22. 22.
    Sarshar, N., Oscar Boykin, P., Roychowdhury, V.: Percolation Search in Power Law Networks: Making Unstructured Peer-to-Peer Networks Scalable. In: Proc. IEEE P2P 2004, pp. 2–9 (2004)Google Scholar
  23. 23.
    Shehory, O.: A Scalable Agent Location Mechanism. In: Proc. ATAL 1999 Intelligent Agents VI, pp. 162–172 (1999)Google Scholar
  24. 24.
    Stoica, I., et al.: Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications. IEEE/ACM Trans. on Networking 11(1), 17–32 (2003)CrossRefGoogle Scholar
  25. 25.
    Tsoumakos, D., Roussopoulos, N.: A Comparison of Peer-to-Peer Search Methods. In: Proc. ACM WebDB 2003, pp. 61–66 (2003)Google Scholar
  26. 26.
    Tsoumakos, D., Roussopoulos, N.: Adaptive Probabilistic Search for Peer-to-Peer Networks. In: Proc. IEEE P2P 2003, pp. 102–109 (2003)Google Scholar
  27. 27.
    Walsh, T.: Search in a Small World. In: Proc. IJCAI 1999, pp. 1172–1177 (July-August 1999)Google Scholar
  28. 28.
    Watts, D., Strogatz, S.: Collective Dynamics of ‘Small-World’ Networks. Nature 393, 440–442 (1998)CrossRefGoogle Scholar
  29. 29.
    Yang, B., Garcia-Molina, H.: Improving Search in Peer-to-Peer Networks. In: Proc. IEEE ICDCS 2002, pp. 5–14 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • George H. L. Fletcher
    • 1
  • Hardik A. Sheth
    • 2
  • Katy Börner
    • 3
  1. 1.Computer Science DepartmentIndiana UniversityBloomingtonUSA
  2. 2.School of InformaticsIndiana UniversityBloomingtonUSA
  3. 3.School of Library and Information ScienceIndiana UniversityBloomingtonUSA

Personalised recommendations