Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bittorrent protocol specication. http://bitconjurer.org/BitTorrent/protocol.html
Kazaa media desktop. http://www.kazaa.com/us/index.htm
Liu, Y., Zhuang, Z., Xiao, L., Ni, L.M.: A distributed approach to solving overlay mismatching problem. In: Proceedings of IEEE ICDCS (2004)
Liu, Y., Xiao, L., Ni, L.M.: Building a scalable bipartite P2P overlay network. In: Proceedings of IEEE IPDPS (2004)
Sripanidkulchai, K., Maggs, B., Zhang, H.: Efficient content location using interest-based locality in peer-to-peer system. In: Proceedings of IEEE INFOCOM (2003)
Jin, H., Ning, X., Chen, H.: Efficient search for peer-to-peer information retrieval using semantic small world. In: Proceedings of WWW (2006)
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)
Watts, D.J., Strogztz, S.H.: Collective dynamics of small-world networks. Nature 393, 440–442 (1998)
http://arxiv.org/abs/cond-mat/0106096 , http://arxiv.org/pdf/cond-mat/0408391
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)
Liu, Y., Liu, X., Xiao, L., Ni, L.M., Zhang.X.: Location-aware topology matching in P2P systems. In: Proceedings of IEEE INFOCOM (2004)
Chawathe, Y., Ramabhadran, S., Ratnasamy, S., LaMarca, A., Shenker, S.: A case study in building layered DHT applications. In: Proceedings of ACM SIGCOMM (2005)
Qiu, D., Srikant, R.: Modeling and performance analysis of BitTorrent-Like peer-to-peer networks. In: Proceedings of ACM SIGCOMM (2004)
Han, J., Liu, Y.: Rumor Riding: anonymizing unstructured peer-to-peer systems. In: Proceedings of IEEE ICNP (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ren, H., Xiao, N., Wang, Z. (2007). An Interest-Based Intelligent Link Selection Algorithm in Unstructured P2P Environment. In: Jin, H., Rana, O.F., Pan, Y., Prasanna, V.K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2007. Lecture Notes in Computer Science, vol 4494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72905-1_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-72905-1_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72904-4
Online ISBN: 978-3-540-72905-1
eBook Packages: Computer ScienceComputer Science (R0)