Full-Information Lookups for Peer-to-Peer Overlays

Abstract

Most peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing information at each member node must be kept small so that the bookkeeping required to respond to system membership changes is also small, given that aggressive membership dynamics are expected. As a consequence, lookups have high latency as each lookup requires contacting several nodes in sequence. In this paper, we question these assumptions by presenting a peer-to-peer routing algorithm with small lookup paths. Our algorithm, called "OneHop," maintains full information about the system membership at each node, routing in a single hop whenever that information is up to date and in a small number of hops otherwise. We show how to disseminate information about membership changes quickly enough so that nodes maintain accurate complete membership information. We also present analytic bandwidth requirements for our scheme that demonstrate that it could be deployed in systems with hundreds of thousands of nodes and high churn. We validate our analytic model using a simulated environment and a real implementation. Our results confirm that OneHop is able to achieve high efficiency, usually reaching the correct node directly 99 percent of the time.

Improving the Video Data Lookup Efficiency in Peer-to-Peer Live Streaming Network

“…For the fast DHT lookup with one hop, some classic One-hop DHTs have been proposed such as D1HT [1], 1h-Calot [2] and OneHop [3]. A comprehensive comparison between these One-hop DHTs can be found in [7] , which shows that D1HT consistently has the smallest overhead and better performance in load balancing than 1h-Calot and OneHop.…”

“…DHT can provide scalable and practical solutions to storing, locating and retrieving widely dispersed information in huge distributed network environments in certain number of hops. According to the different hop counts, DHTs can be classified into One-hop [1]- [3] and Multi-hop DHTs, which represent different trade-offs between lookup performance and maintenance overhead. Multi-hop DHTs aim at keeping a partial routing table to minimize the maintenance overhead, while the cost is the degradation of lookup performance after contacting several peers in sequence.…”

Validation of H-P2PSIP, a scalable solution for interoperability among different overlay networks

“…Modelnet is demonstrated to be a good option since the research community is using it to validate many flavours of peer-to-peer applications. Some examples are peer-topeer online games [49], peer-to-peer video on demand [46], peer-to-peer networks [16,27] peer-to-peer filesystems [8] or the Tor emulation platform, which is also based on Modelnet [4].…”

FRT-2-Chord: A DHT supporting seamless transition between one-hop and multi-hop lookups with symmetric Routing Table

“…This restriction prevents queries from being routed in one hop. In EpiChord [12] and OneHop [13], the routing table size is large enough to contain all nodes in an overlay. However, to achieve this, EpiChord and OneHop do not work when the number of nodes is larger than expected.…”