Abstract
Unstructured Peer-to-Peer (P2P) overlays are the most widely used topologies in P2P systems because of their simplicity and very limited control overhead. A P2P overlay specifies the logical connections among peers in a network. Such logical links define the order in which peers are queried in search for a specific resource. The most popular query routing algorithms are based on flooding, thus they do not scale well as each query generates a large amount of traffic. In this paper, we use heuristics to improve overlay search in an unstructured P2P file sharing system. The proposed heuristics effectively decide replica locations for popular resources based on the availability of computing and storage at a given peer, its neighborhood information, and the used routing strategy. Simulations performed over two different types of unstructured P2P network topologies (i.e., power law and random graphs) show significant improvements over plain flooding in terms of reduced network traffic and search time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Schulze, H., Mochalski, K.: ipoque GmbH Internet Study (2008/2009), http://www.ipoque.com/sites/default/files/mediafiles/documents/internet-study-2008-2009.pdf (retrieved January 28, 2013)
Tigelaar, A.S., Hiemstra, D., Trieschnigg, D.: Peer-to-peer information retrieval: An overview. ACM Trans. Inf. Syst. 30(2), 9:1–9:34 (2012)
Zhuang, Z., Liu, Y., Xiao, L., Ni, L.: Hybrid periodical flooding in unstructured peer-to-peer networks. In: Proc. of ICPP 2003, pp. 171–178 (October 2003)
Haribabu, K., Reddy, D., Hota, C., Ylä-Jääski, A., Tarkoma, S.: Adaptive lookup for unstructured peer-to-peer overlays. In: Proc. of COMSWARE 2008, pp. 776–782 (January 2008)
Xiao, L., Liu, Y., Ni, L.: Improving unstructured peer-to-peer systems by adaptive connection establishment. IEEE Trans. on Computers 54(9), 1091–1103 (2005)
Haribabu, K., Hota, C., Ylä-Jääski, A.: Indexing through querying in unstructured peer-to-peer overlay networks. In: Ma, Y., Choi, D., Ata, S. (eds.) APNOMS 2008. LNCS, vol. 5297, pp. 102–111. Springer, Heidelberg (2008)
Patro, S., Hu, Y.: Transparent query caching in peer-to-peer overlay networks. In: Proc. of Parallel and Distributed Processing Symposium (April 2003)
Chu, Y., Rao, S., Seshan, S., Zhang, H.: A case for end system multicast. IEEE Journal on Selected Areas in Communications 20(8), 1456–1471 (2002)
Nakao, A., Peterson, L., Bavier, A.: A routing underlay for overlay networks. In: Proc. of SIGCOMM 2003, pp. 11–18 (2003)
Fast, A., Jensen, D., Levine, B.N.: Creating social networks to improve peer-to-peer networking. In: Proc. of ACM SIGKDD 2005, pp. 568–573 (2005)
Lin, C.J., Chang, Y.T., Tsai, S.C., Chou, C.F.: Distributed social-based overlay adaptation for unstructured P2P networks. In: IEEE Global Internet Symposium, pp. 1–6 (May 2007)
Hota, C., Nunia, V., Ylä-Jääski, A.: Distributed algorithms for improving search efficiency in peer-to-peer overlays. International Journal of Computer Networks and Information Security 4(3), 1–7 (2012)
Cholvi, V., Felber, P., Biersack, E.: Efficient search in unstructured peer-to-peer networks. In: Proc. of SPAA 2004, pp. 271–272 (2004)
Lv, Q., Cao, P., Cohen, E., Li, K., Shenker, S.: Search and replication in unstructured peer-to-peer networks. In: Proc. of ICS 2002, pp. 84–95 (2002)
Kitamura, H., Fujita, S.: A biased k-random walk to find useful files in unstructured peer-to-peer networks. In: 2009 International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 210–216 (December 2009)
Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: Making gnutella-like P2P systems scalable. In: Proc. of SIGCOMM 2003, pp. 407–418 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hota, C., Nunia, V., Di Francesco, M., Nurminen, J.K., Ylä-Jääski, A. (2013). Enhanced Search in Unstructured Peer-to-Peer Overlay Networks. In: Park, J.J.(.H., Arabnia, H.R., Kim, C., Shi, W., Gil, JM. (eds) Grid and Pervasive Computing. GPC 2013. Lecture Notes in Computer Science, vol 7861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38027-3_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-38027-3_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38026-6
Online ISBN: 978-3-642-38027-3
eBook Packages: Computer ScienceComputer Science (R0)