Abstract

In this work, we study a fundamental tradeoff issue in designing distributed hash table (DHT) in peer-to-peer networks: the size of the routing table v.s. the network diameter. It was observed by Ratnasamy et al. that existing DHT schemes either (a) have a routing table of size O(log2n) and network diameter of #(log2n), or (b) have a routing table of size d and network diameter of #(n ). They asked whether this represents the best asymptotic "state-efficiency" tradeoffs. Our first major result is to show that there are straightforward routing algorithms which achieve better asymptotic tradeoffs. However, such algorithms all cause severe congestion on certain network nodes, which is undesirable in a P2P network. We then rigorously define the notion of "congestion" and conjecture that the above tradeoffs are asymptotically optimal for a congestion-free network. In studying this conjecture, we have thoroughly clarified the role that "congestionfree " plays in this "state-efficiency" tradeoff. Our second major result is to prove that the aforementioned tradeoffs are asymptotically optimal for uniform algorithms. Furthermore, for uniform algorithms, we find that the routing table size of #(log2n) is a magic threshold point that separates two different "state-efficiency" regions. Our third and final result is to study the exact (instead of asymptotic) optimal tradeoffs for uniform algorithms. We propose a new routing algorithm that reduces the routing table size and the network diameter of Chord both by 21.4% without introducing any other protocol overhead, based on a novel number-theoretical technique.

Citations

3028	H.: Chord: A scalable Peer-To-Peer lookup service for internet applications - Stoica, Morris, et al.
2353	A scalable content-addressable network - Ratnasamy, Francis, et al. - 2001
1813	The Art of Computer Programming - Knuth - 1968
1503	Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems - Rowstron, Druschel - 2001
928	Tapestry: An infrastructure for fault-tolerant wide-area location and routing - Zhao, Kubiatowicz, et al. - 2001
422	Accessing nearby copies of replicated objects in a distributed environment - Plaxton, Rajaraman, et al. - 1997
260	Viceroy: A Scalable and Dynamic Emulation of the Butterfly - Malkhi, Naor, et al. - 2002
210	Yoid: Extending the Internet Multicast Architecture. http://www.icir.org/yoid - Francis
121	Routing algorithms for DHTs: Some open questions - Ratnasamy, Shenker, et al. - 2002
111	A tradeoff between space and efficiency for routing tables - Peleg, Upfal - 1988
59	Fast Storage Allocator - Knowlton - 1965
13	Ulysses: A robust, low-diameter, low-latency peer-to-peer network - Kumar, Merugu, et al. - 2003
1	A Counter Example,” Private correspondence - Karp - 2002
1	Ulysses: A low diameter peer-to-peer network,” Tech - Kumar, Xu, et al. - 2002
1	Ulysses: A low diameter peer-to-peer network - Kumar, Xu, et al. - 2002
1	A Counter Example," Private correspondence - Karp - 2002