Adding Structure to Unstructured Peer-to-Peer Networks: The Role of Overlay Topology

  • Shashidhar Merugu
  • Sridhar Srinivasan
  • Ellen Zegura
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2816)


Our work examines the role of overlay topology on the performance of unstructured peer-to-peer systems. We focus on two performance metrics: (a) search protocol performance, a local gain perceived directly by a user of the system and (b) utilization of the network, a global property that is of interest to network service providers. We present a class of overlay topologies based on distance between a node and its neighbors. We show, by simulation, that a particular topology instance of this class where every node has many close neighbors and few random neighbors exhibits better properties than other examined instances. In this overlay topology, the chances of locating files are high and the nodes where these files are found are, on average, close to the query source. This improvement in search protocol performance is achieved while decreasing the traffic load on the links in the underlying network. We propose a simple greedy algorithm to construct such topologies where each node operates independently and in a decentralized manner.


Random Graph Search Query Average Path Length Proximity Factor Search Radius 
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.
    Oram, A. (ed.): Peer-to-Peer: Harnessing the Power of Disruptive Technologies. O’Reilly, Sebastopol (2001)Google Scholar
  2. 2.
  3. 3.
  4. 4.
    Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. ACM SIGCOMM (2001)Google Scholar
  5. 5.
    Ratnaswamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content Addressable Network. ACM SIGCOMM (2001)Google Scholar
  6. 6.
    Ratnaswamy, S., Shenker, S., Stoica, I.: Routing Algorithms for DHTs: Some Open Questions. In: First Intl. Workshop on Peer-to-Peer Systems (March 2002)Google Scholar
  7. 7.
    Ripeanu, M., Foster, I., Iamnitchi, A.: Mapping the Gnutella Network: Properties of Large Scale Peer-to-Peer Systems and Implications for System Design. IEEE J. on Internet Computing (2002); Special Issue on Peer-to-peer NetworkingGoogle Scholar
  8. 8.
    Sen, S., Wang, J.: Analyzing peer-to-peer traffic across large networks. In: Internet Measurement Workshop (2002)Google Scholar
  9. 9.
    Watts, D.J.: Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton (1999)Google Scholar
  10. 10.
    Kleinberg, J.: The Small-World Phenomenon:An Algorithmic Perspective. In: ACM Symposium on Theory of Computing (2000)Google Scholar
  11. 11.
    Albert, R., Jeong, H., Barabási, A.L.: The Diameter of the World-Wide Web. Nature (1999)Google Scholar
  12. 12.
    Saroiu, S., Gummadi, K., Gribble, S.: A Measurement Study of Peer-to-Peer File Sharing Systems. In: Multimedia Conferencing and Networking (January 2002)Google Scholar
  13. 13.
  14. 14.
    Bollobás, B.: Random Graphs. Cambridge University Press, Cambridge (2001)zbMATHGoogle Scholar
  15. 15.
    Chu, Y., Rao, S.G., Seshan, S., Zhang, H.: A Case for End System Multicast. IEEE Journal on Selected Areas in Communication (2002); Special Issue on Networking Support for MulticastGoogle Scholar
  16. 16.
    Zegura, E., Calvert, K., Donahoo, M.J.: A Quantitative Comparison of Graph based Models for Internet Topology. IEEE/ACM Trans. on Networking (December 1997)Google Scholar
  17. 17.
    Merugu, S., Srinivasan, S., Zegura, E.: Adding structure to unstructured peerto- peer networks: the role of overlay topology. Tech. Rep. GIT-CC-03-31, College of Computing, Georgia Institute of Technology (2003)Google Scholar
  18. 18.
    Ratnaswamy, S., Handley, M., Karp, R., Shenker, S.: Topologically-Aware Overlay Construction and Server Selection. Infocom (2002)Google Scholar
  19. 19.
    Shankar, N., Komareddy, C., Bhattacharjee, S.: Finding Close Friends over the Internet. In: International Conference on Network Protocols (2001)Google Scholar
  20. 20.
    Banerjee, S., Komareddy, C., Bhattacharjee, S.: Scalable Peer Finding on the Internet. In: Global Internet Symposium, Globecom (2002)Google Scholar
  21. 21.
    Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems. Infocom (2003)Google Scholar
  22. 22.
    Zhang, H., Goel, A., Govindan, R.: Using the Small-World Model to Improve Freenet Performance. Infocom (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Shashidhar Merugu
    • 1
  • Sridhar Srinivasan
    • 1
  • Ellen Zegura
    • 1
  1. 1.Georgia Institute of TechnologyCollege of ComputingAtlantaUSA

Personalised recommendations