A popularity-based query scheme in P2P networks using adaptive gossip sampling

• Published in: Peer-to-peer networking and applications Vol. 6; no. 1; pp. 75 - 85
• Main Authors: Sharifi, Leila, Khorsandi, Siavash
• Format: Journal Article
• Language: English
• Published: Boston Springer US 01-03-2013; Springer Nature B.V
• Subjects: Accuracy; Communications Engineering; Computer Communication Networks; Computer simulation; Content analysis; Engineering; Information Systems and Communication Service; Mathematical analysis; Networks; Peer to peer computing; Popularity; Sampling; Searching; Signal,Image and Speech Processing; Social networks; Tables (data); Gossip sampling; Unstructured peer to peer overlay; Gossip exchange method; Content popularity
• ISSN: 1936-6442; 1936-6450
• DOI: 10.1007/s12083-012-0135-9

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.