Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead

By Indranil Gupta, K. Birman, Prakash Linga, A. Demers, Robbert van Renesse. International Workshop on Peer-to-Peer Systems, 2003

353 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The design and implementation of a next generation name service for the internet (2004, background): “Kelips [14] limits lookup latency to one or two hops by repli-”
Squirrel: a decentralized peer-to-peer web cache (2002, neutral): “Based on the Kelips peer-to-peer routing substrate[4], which consists of virtual subgroups and runs a low-cost background communication mechanism, it imposes a constant load on participants and is able to reorganize itself continuously under churn.”
Designing a DHT for Low Latency and High Throughput (2004, methodology): “Second, we assume that lookups are routed using one of the O(log N)-style schemes, instead of using the recently proposed O(1) schemes [14, 17, 18, 44].”
Survey of research towards robust peer-to-peer networks: Search methods (2006, methodology): “For a churning 1024-node network, Li et al. concluded that OneHop is superior to Chord, Tapestry , Kademlia and Kelips in terms of latency and lookup success rate [270].”
A scalable distributed information management system (2004, background): “Recent research in peer-to-peer structured networks resulted in Distributed Hash Tables (DHTs) [1, 16 , 17, 21, 23, 26, 27, 29, 32, 33, 36, 40, 47]—a data structure that scales with the number of nodes and that distributes the read-write load for different queries among the participating nodes.”