Topology and Resource Discovery in Peer-to-Peer Overlay Networks

  • Dongsheng Li
  • Nong Xiao
  • Xicheng Lu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3252)


Peer-to-Peer networks have attracted significant attention these days. The paper firstly introduce the characteristics and challenges of P2P networks and then surveys four categories of P2P topologies: centralized topology, decentralized unstructured topology, decentralized structured topology and partially decentralized topology. The characteristics, advantages and disadvantages and current researches of the four topologies are discussed. Many open problems and their recent developments are analyzed thoroughly.


Overlay Network Distribute Hash Table Resource Discovery Malicious Peer Search Request 
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.
    Saroiu, S., Krishna Gummadi, P.: Steven D. Gribble: A measurement study of peer-topeer file sharing systems. In: Proc. of MMCN 2002 (2002)Google Scholar
  2. 2.
    Jovanovic, M., Annexstein, F.S., Berman, K.A.: Modeling peer-to-peer network topologies through small-World models and power laws. In: TELFOR, Belgrade, Yugoslavia (November 2001)Google Scholar
  3. 3.
    Adamic, L.A., Humberman, B., Lukose, R., Puniyani, A.: Search in power law networks. Phys. Rev. E 64, 46135–46143 (2001)CrossRefGoogle Scholar
  4. 4.
    Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-topeer networks. In: Proc. of ICS 2002, New York, USA (2002)Google Scholar
  5. 5.
    Yang, B., Garcia-Molina, H.: Efficient search in peer-to-peer networks. In: Proc. of ICDCS 2002, Vienna, Austria (2002)Google Scholar
  6. 6.
    Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proc. of Infocom 2004 (2004)Google Scholar
  7. 7.
    Crespo, A., Garcia-Molina, H.: Routing indices for peer-to-peer systems. In: Proc. of ICDCS 2002, Vienna, Austria (2002)Google Scholar
  8. 8.
    Cohen, E.: Associative search in peer to peer networks: harnessing latent semantics. In: Proc. of Infocom 2003 (2003)Google Scholar
  9. 9.
    Sripanidkulchai, K.: The popularity of Gnutella queries and its implications on scalability. White paper, Carnegie Mellon Univ. (2001), available online at
  10. 10.
    Evangelos, P.: Markatos: Tracing a large-scale Peer to Peer System: an hour in the life of Gnutella. In: Proc. of CCGrid 2002(2002)Google Scholar
  11. 11.
    cohen, E., shenker, S.: Replication strategies in unstructured peer-to-peer networks. In: Proc. of ACM Sigcomm 2002 (2002)Google Scholar
  12. 12.
    Pandurangan, G., Raghavan, P., Upfal, E.: Building low diameter peer-to-peer networks. In: Proc. of FOCS 2001 (2001)Google Scholar
  13. 13.
    Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interestbased locality in peer-to-peer systems. In: Proc. of Infocom 2003 (2003)Google Scholar
  14. 14.
    Wouhaybi, R.H., Campbell, A.T.: Phenix: supporting resilient low-diameter peer-topeer topologoies. In: Proc. of Infocom 2004 (2004)Google Scholar
  15. 15.
    Zhang, H., Goel, A., Govindan, R.: Using the small-world model to improve freenet performance. In: Proc. of Infocom 2002 (2002)Google Scholar
  16. 16.
    Ratnasamy, S., Shenker, S., Stoica, I.: Routing algorithms for DHTs: some open questions. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, Springer, Heidelberg (2002)CrossRefGoogle Scholar
  17. 17.
    Balakrishnan, H., Kaashoek, M.F., Karger, D., et al.: Looking up data in p2p systems. Communications of the ACM 46(2), 43–48 (2003)CrossRefGoogle Scholar
  18. 18.
    Xu, J., Kumar, A., Yu, X.: On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE JSAC (1) (2004)Google Scholar
  19. 19.
    Li, D., Fang, X., Wang, Y., et al.: A Scalable peer-to-peer network with constant degree. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds.) APPT 2003. LNCS, vol. 2834, pp. 414–425. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  20. 20.
    Li, D., Lu, X., Su, J.: Graph-theoretic analysis of Kautz topology and DHT schemes. In: Proc. of IFIP NPC 2004 (2004)Google Scholar
  21. 21.
    Gupta, I., Birman, K., Linga, P., et al.: Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, Springer, Heidelberg (2003)CrossRefGoogle Scholar
  22. 22.
    Yang, B., Garcia-Molina, H.: Designing a super-peer network. In: Proc. of ICDE 2003 (2003)Google Scholar
  23. 23.
    Xu, Z., Mahalingam, M., Karlsson, M.: Turining Heterogeneity into an advantage in overlay routing. In: Proc. of IEEE Infocom 2003 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Dongsheng Li
    • 1
  • Nong Xiao
    • 1
  • Xicheng Lu
    • 1
  1. 1.School of ComputerNational University of Defense TechnologyChangshaP.R. China

Personalised recommendations