Gossip‐based search selection in hybrid peer‐to‐peer networks

Abstract

SUMMARYWe present GAB, a search algorithm for hybrid peer-to-peer networks, that is, networks that search using both flooding and a distributed hash table (DHT). GAB uses a gossip-style algorithm to collect global statistics about document popularity to allow each peer to make intelligent decisions about which search style to use for a given query. Moreover, GAB automatically adapts to changes in the operating environment. Synthetic and trace-driven simulations show that compared to a simple hybrid approach that always floods first, trying a DHT if too few results are found, GAB reduces the response time by 25-50% and the average query bandwidth cost by 45%, with no loss in recall. GAB scales well, with only a 7% degradation in performance despite a tripling in system size.

An Adversarial Evaluation of Network Signaling and Control Mechanisms

“…There is a wealth of recent research on hybrid designs [29,8,10] all of which share the same basic design principles with minor modifications. Moreover, there are systems that attempt to combine two distributed mechanisms of structured (DHTs) and unstructured (gossip protocol) to achieve better search efficiency [12,28].…”

Optimizing capacity-heterogeneous unstructured P2P networks for random-walk traffic

“…In this paper, we assume a general unstructured P2P network that utilizes random walks (as opposed to flooding [6], [22] or some hybrid methods [3], [23]) for finding neighbors, searching for content, and replicating existing file pointers. The reason for using random walks is their ability to achieve arbitrary stationary distributions (see below) across existing nodes in the system and clear bounds on overhead.…”

Special Issue: Recent Advances in Peer‐to‐Peer Systems and Security

“…This issue includes five papers, two of which [7,8] present novel approaches to enhance the efficiency of current file-sharing networks, while the other three [9-11] examine security-related issues including reputations, incentives and misbehaving users. In the first paper, Epema et al [7] propose Tribler, a new content-sharing protocol that leverages social relationships to enhance performance.…”

“…By leveraging shared interests, Tribler encourages users to behave altruistically, and shows that with willing helpers, downloaders can dramatically reduce their download latencies. The second paper [8] proposes the novel application of a probabilistic counting algorithm to hybrid search. To estimate whether a file is popular, the authors propose that…”