Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

IPTPS
2003
Springer

favoriteEmaildiscussreport

149views Computer Networks» more IPTPS 2003»

Koorde: A Simple Degree-Optimal Distributed Hash Table

13 years 9 months ago

Koorde: A Simple Degree-Optimal Distributed Hash Table

Download www.comp.nus.edu.sg

Koorde1 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.

M. Frans Kaashoek, David R. Karger

Real-time Traffic

Bruijn Graphs | IPTPS 2003 | Lookup Request | Various Lower Bounds |

claim paper

Related Content

» Simple Efficient LoadBalancing Algorithms for PeertoPeer Systems

» Lookup Tables FineGrained Partitioning for Distributed Databases

» A Simple Fault Tolerant Distributed Hash Table

» Magic Square Scalable PeertoPeer Lookup Protocol Considering Peers Characteristics

» Cerco Supporting Range Queries with a Hierarchically Structured PeertoPeer System

» Managing Statistical Behavior of Large Data Sets in SharedNothing Architectures

» Ranged hash functions and the price of churn

» FISSIONE a scalable constant degree and low congestion DHT scheme based on Kautz graphs

» Dynamic Load Balancing in Distributed Hash Tables

Post Info
More Details (n/a)

Added	07 Jul 2010
Updated	07 Jul 2010
Type	Conference
Year	2003
Where	IPTPS
Authors	M. Frans Kaashoek, David R. Karger

Comments (0)