An Interest-Based Intelligent Link Selection Algorithm in Unstructured P2P Environment

  • Hao Ren
  • Nong Xiao
  • Zhiying Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4494)


Nowadays, most of the running P2P file sharing systems, such as Gnutella, generally adopt an unstructured topology and flooding search algorithms, which facing very serious search efficiency problem. In this paper, we proposed a novel intelligent link selection algorithm to address the search efficiency problem by exploiting the principle of interest-based locality. Specifically, peers continually build new connections with the others peers with same interests, this enables peers find its interest files in the nearby ones. In addition, in order to avoid adding too many connections in the overlay network which may lead the flooding search produce excessive redundant message as a consequence, we adopt a dynamic balance mechanism to delete the connection between peers which brings the least useful message. The simulation study shows our algorithm can significantly cut down the reply path lengths, achieve high search success rate with smaller search scope, and reduce the total communication cost in unstructured P2P systems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bittorrent protocol specication.
  2. 2.
  3. 3.
    Kazaa media desktop.
  4. 4.
    Liu, Y., Zhuang, Z., Xiao, L., Ni, L.M.: A distributed approach to solving overlay mismatching problem. In: Proceedings of IEEE ICDCS (2004)Google Scholar
  5. 5.
    Liu, Y., Xiao, L., Ni, L.M.: Building a scalable bipartite P2P overlay network. In: Proceedings of IEEE IPDPS (2004) Google Scholar
  6. 6.
    Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in peer-to-peer system. In: Proceedings of IEEE INFOCOM (2003) Google Scholar
  7. 7.
    Jin, H., Ning, X., Chen, H.: Efficient search for peer-to-peer information retrieval using semantic small world. In: Proceedings of WWW (2006)Google Scholar
  8. 8.
    Barbosa, M.W., Costa, M.M., Almeida, J.M., Almeida, V.A.F.: Using locality of reference to improve performance of peer-to-peer applications. ACM SIGSOFT Software Engineering Notes archive 29(1), 216–227 (2004)CrossRefGoogle Scholar
  9. 9.
  10. 10.
    Watts, D.J., Strogztz, S.H.: Collective dynamics of small-world networks. Nature 393, 440–442 (1998)CrossRefGoogle Scholar
  11. 11.
  12. 12.
    Chawathe,Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like P2P systems scalable. In: Proceeding of the ACM SIGCOMM 2003, Karlsruhe (2003)Google Scholar
  13. 13.
    Liu, Y., Liu, X., Xiao, L., Ni, L.M., Zhang.X.: Location-aware topology matching in P2P systems. In: Proceedings of IEEE INFOCOM (2004)Google Scholar
  14. 14.
    Chawathe, Y., Ramabhadran, S., Ratnasamy, S., LaMarca, A., Shenker, S.: A case study in building layered DHT applications. In: Proceedings of ACM SIGCOMM (2005)Google Scholar
  15. 15.
    Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrent-Like peer-to-peer networks. In: Proceedings of ACM SIGCOMM (2004)Google Scholar
  16. 16.
    Han, J., Liu, Y.: Rumor Riding: anonymizing unstructured peer-to-peer systems. In: Proceedings of IEEE ICNP (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Hao Ren
    • 1
  • Nong Xiao
    • 1
  • Zhiying Wang
    • 1
  1. 1.School of Computer, NUDT, ChangShaChina

Personalised recommendations