Abstract
As P2P networks, such as many forms of social networking have been rapidly growing, numerous efforts have been made to improve the efficiency of the search operation especially in terms of response time and hit ratio. To this end, popularity-based schemes have recently attracted attention aimed at increasing search efficiency using content popularity ranking; however, these methods suffer from high cost and overhead, or inappropriate level of accuracy in specifying the popularity. In this paper, we propose an adaptive sampling scheme to make a tradeoff between cost and accuracy. This scheme relies on exchanging File Index Table (FIT) between peers in a local neighborhood using a Gossip Exchange Method (GEM). The proposed Hybrid Adaptive Search According to Gossip Exchange Method (HAS-A-GEM) is based on smart unstructured peer to peer overlays. We apply a hybrid overlay that efficiently combines topology-aware and interest-based links instead of random or DHT invoked connections. An analytical model as well as a simulation framework is developed to illustrate the performance of this scheme. The effectiveness of the proposed scheme is demonstrated under various conditions. Simulation results reveal that HAS-A-GEM performs well for large-scale networks, exploiting local content popularity when each local area contains enough number of peers.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
BT Loo, Hellerstein JM, Huebsch R, Shenker S, Stoica I (2004) Enhancing P2P file sharing with an internet-scale query processor, VLDB
Loo BT, Huebsch R, Stoica I, Hellerstein JM (2004) The case for a hybrid P2P search infrastructure. IPTPS
Kamran MM, Khorsandi S (2010) A popularity-based globally structured hybrid peer-to-peer network. ICINA: V1-411–V1-415
Kamran MM, Khorsandi S (2011) Popularity estimation in a popularity-based P2P networks. ICACT 2011:399–404
Zaharia M, Keshav S (2006) Gossip-based search selection in hybrid peer-to-peer networks. IPTPS
Shi X et al (2009) Popularity adaptive search in hybrid P2P systems. Parallel Distr Comput 69:125–134
Rongmei Z, Hu YC (2007) Assisted peer-to-peer search with partial indexing. Parallel Distr Syst 18(18):1146–1158
Bressan S, Hidayanto AN, Hasibuan ZA (2005) Exploiting local popularity to prune routing indices in peer-to-peer systems. Sixteenth International Workshop on Database and Expert Systems Applications
Hefeeda M, Saleh O (2008) Traffic modeling and proportional partial caching for peer-to-peer systems. IEEE/ACM Transactions on Networking 16(6):1447–1460
Rao W et al (2010) Optimal resource placement in structured peer-to-peer networks. IEEE Trans Parallel Distr Syst 21(7):1011–1026
Zhang G, Zhang G (2007) Agent selection and P2P overlay construction using global locality. ICNSC
Zhang X, Li Zh, Wang Y (2008) A Distributed Topology-aware Overlays Construction Algorithm, 15th ACM Mardi Gras conference: From lightweight mash-ups to lambda grids
Xiao L, Liu Y, Ni LM (2005) Improving unstructured peer-to-peer systems by adaptive connection establishment. IEEE TRANSACTIONS ON COMPUTERS 54
Qiu T, et al (2007) Towards location-aware topology in both unstructured and structured P2P system. International Conference on Parallel Processing
Zhang XY et al (2004) A construction of locality- aware overlay network: overlay and its performance. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 22
Ratnasamy S et al (2002) Topologically-aware overlay construction and server selection. IEEE INFOCOM
Liu Y et al (2005) Location-awareness in unstructured peer-to-peer systems. IEEE Transaction on Parallel and Distributed Systems 16(2)
Stutzbach D et al (2009) On unbiased sampling for unstructured peer to peer networks. IEEE/ACM Transactions on Networking
Jelasity M et al (2007) Gossip based peer sampling. ACM Transaction on Computer Systems 25(3)
Shvaiko P, Euzenat J (2008) Ten challenges for ontology matching. lecture notes in computer science. Springer 5332/2008: 164–1182
Xiao H, Cruz IF (2006) Ontology-based query rewriting in peer-to-peer networks. Proceedings of the 2nd International Conference on Knowledge Engineering and Decision Support
Montanelli S, Castano S (2008) Semantically routing queries in peer-based systems: the h-link approach. The Knowledge Engineering Review 23(1)
Saroiu S, Gummadi PK, Gribble SD (2002) A measurement study of peer-to-peer file sharing systems. Multimedia Computing and Networking
Zoels S et al (2008) On hierarchical DHT systems—an analytical approach for optimal design. Computer Communications 31(3)
Ahulló JP, López PG (2008) PlanetSim: an extensible framework for overlay network and services simulations. Simutools '08
Gummadi K, Dunn R, Saroiu S, Gribble S, Levy H, Zahorjan J (2003) Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. SOSP’03
Ripeanu M, Foster I, Lamnitchi A (2002) Mapping the Gnutella network: properties of large-scale p2p networks and implications for system design. IEEE Internet Computing, 2002
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sharifi, L., Khorsandi, S. A popularity-based query scheme in P2P networks using adaptive gossip sampling. Peer-to-Peer Netw. Appl. 6, 75–85 (2013). https://doi.org/10.1007/s12083-012-0135-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12083-012-0135-9