Results 1  10
of
58
Koorde: A simple degreeoptimal distributed hash table
, 2003
"... Koorde is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such as O(log n) hops per lookup request with only 2 neighbors per node (where n is the number of nodes in the DHT), and O(log n ..."
Abstract

Cited by 216 (1 self)
 Add to MetaCart
(Show Context)
Koorde is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2]. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such as O(log n) hops per lookup request with only 2 neighbors per node (where n is the number of nodes in the DHT), and O(log n/ log log n) hops per lookup request with O(log n) neighbors per node.
Novel Architectures for P2P Applications: the ContinuousDiscrete Approach
 ACM TRANSACTIONS ON ALGORITHMS
, 2007
"... We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to processors. We demonstrate the power of these design rules by suggesting two new architectures, one for DHT (Distributed Hash Table) and the other for dynamic ex ..."
Abstract

Cited by 166 (8 self)
 Add to MetaCart
(Show Context)
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to processors. We demonstrate the power of these design rules by suggesting two new architectures, one for DHT (Distributed Hash Table) and the other for dynamic expander networks. The DHT network, which we call Distance Halving, allows logarithmic routing and load, while preserving constant degrees. Our second construction builds a network that is guaranteed to be an expander. The resulting topologies are simple to maintain and implement. Their simplicity makes it easy to modify and add protocols. We show it is possible to reduce the dilation and the load of the DHT with a small increase of the degree. We present a provably good protocol for relieving hot spots and a construction with high fault tolerance. Finally we show that, using our approach, it is possible to construct any family of constant degree graphs in a dynamic environment, though with worst parameters. Therefore we expect that more distributed data structures could be designed and implemented in a dynamic environment.
GraphTheoretic Analysis of Structured PeertoPeer Systems: Routing Distances and Fault Resilience
, 2003
"... This paper examines graphtheoretic properties of existing peertopeer architectures and proposes a new infrastructure based on optimaldiameter de Bruijn graphs. Since generalized de Bruijn graphs possess very short average routing distances and high resilience to node failure, they are well suite ..."
Abstract

Cited by 127 (7 self)
 Add to MetaCart
(Show Context)
This paper examines graphtheoretic properties of existing peertopeer architectures and proposes a new infrastructure based on optimaldiameter de Bruijn graphs. Since generalized de Bruijn graphs possess very short average routing distances and high resilience to node failure, they are well suited for structured peertopeer networks. Using the example of Chord, CAN, and de Bruijn, we first study routing performance, graph expansion, and clustering properties of each graph. We then examine bisection width, path overlap, and several other properties that affect routing and resilience of peertopeer networks. Having confirmed that de Bruijn graphs offer the best diameter and highest connectivity among the existing peertopeer structures, we offer a very simple incremental building process that preserves optimal properties of de Bruijn graphs under uniform user joins/departures. We call the combined peertopeer architecture
Routing Networks for Distributed Hash Tables
, 2003
"... Routing topologies for distributed hashing in peertopeer networks are classified into two categories: deterministic and randomized. A general technique for constructing deterministic routing topologies is presented. Using this technique, classical parallel interconnection networks can be adapted ..."
Abstract

Cited by 56 (7 self)
 Add to MetaCart
(Show Context)
Routing topologies for distributed hashing in peertopeer networks are classified into two categories: deterministic and randomized. A general technique for constructing deterministic routing topologies is presented. Using this technique, classical parallel interconnection networks can be adapted to handle the dynamic nature of participants in peertopeer networks. A unified picture of randomized routing topologies is also presented. Two new protocols are described which improve average latency as a function of outdegree. One of the protocols can be shown to be optimal with high probability. Finally, routing networks for distributed hashing are revisited from a systems perspective and several open design problems are listed.
Estimating Network Size from Local Information
 Information Processing Letters
, 2003
"... this paper, we provide a localized estimation scheme that has good worst case accuracy. The scheme requires each joining node to communicate only with two nodes, its initial contact and one additional node. The expected accuracy of our estimator is within the range n=2::n , provided that the join ..."
Abstract

Cited by 49 (1 self)
 Add to MetaCart
(Show Context)
this paper, we provide a localized estimation scheme that has good worst case accuracy. The scheme requires each joining node to communicate only with two nodes, its initial contact and one additional node. The expected accuracy of our estimator is within the range n=2::n , provided that the joiners' contact points are assigned at random
Broose: a Practical Distributed Hashtable based on the DeBruijn Topology
, 2004
"... Broose is a peertopeer protocol based on the DeBruijn topology allowing a distributed hashtable to be maintained in a loose manner. Each association is stored on k nodes to allow higher reliability with regard to node failures. Redundancy is also used when storing contacts avoiding complex topol ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
Broose is a peertopeer protocol based on the DeBruijn topology allowing a distributed hashtable to be maintained in a loose manner. Each association is stored on k nodes to allow higher reliability with regard to node failures. Redundancy is also used when storing contacts avoiding complex topology maintenance for node departures and arrivals. It uses a constant size routing table of O(k) contacts for allowing lookups in O(log N) message exchange (where N is the number of nodes participating). It can also be parameterized for obtaining O(log N / log log N) steps lookups with a routing table of size O(k log N). These bounds hold with high probability. Moreover, the protocol allows load balancing of hotspots of requests for a given key as well as hotspots of key collisions. The goal is to obtain a protocol as practical as Kademlia based on the DeBruijn topology.
Know thy Neighbor's Neighbor: Better Routing for SkipGraphs and Small Worlds
 in Proc. of IPTPS, 2004
, 2004
"... We investigate an approach for routing in p2p networks called neighborofneighbor greedy. We show that this approach may reduce significantly the number of hops used, when routing in skip graphs and small worlds. Furthermore we show that a simple variation of Chord is degree optimal. Our algorithm ..."
Abstract

Cited by 22 (1 self)
 Add to MetaCart
(Show Context)
We investigate an approach for routing in p2p networks called neighborofneighbor greedy. We show that this approach may reduce significantly the number of hops used, when routing in skip graphs and small worlds. Furthermore we show that a simple variation of Chord is degree optimal. Our algorithm is implemented on top of the conventional greedy algorithms, thus it maintains the good properties of greedy routing. Implementing it may only improve the performance of the system.
On ZoneBalancing of PeertoPeer Networks: Analysis of Random Node Join
, 2004
"... Balancing peertopeer graphs, including zonesize distributions, has recently become an important topic of peertopeer (P2P) research [1], [2], [6], [19], [31], [36]. To bring analytical understanding into the various peerjoin mechanisms, we study how zonebalancing decisions made during the initi ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
Balancing peertopeer graphs, including zonesize distributions, has recently become an important topic of peertopeer (P2P) research [1], [2], [6], [19], [31], [36]. To bring analytical understanding into the various peerjoin mechanisms, we study how zonebalancing decisions made during the initial sampling of the peer space a#ect the resulting zone sizes and derive several asymptotic results for the maximum and minimum zone sizes that hold with high probability.