Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On Routing in Distributed Hash Tables Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le Boudec, Karl Aberer
 

Summary: On Routing in Distributed Hash Tables
Fabius Klemm, Sarunas Girdzijauskas, Jean-Yves Le Boudec, Karl Aberer
School of Computer and Communication Sciences
Ecole Polytechnique F´ed´erale de Lausanne (EPFL), Switzerland
Abstract
There have been many proposals for constructing rout-
ing tables for Distributed Hash Tables (DHT). They can
be classified into two groups: A) those that assume that
the peers are uniformly randomly distributed in the iden-
tifier space, and B) those that allow order-preserving
hash functions that lead to a skewed peer distribution
in the identifier space.
Good solutions for group A have been known for many
years. However, DHTs in group A are limited to use ran-
domized hashing and therefore, queries over whole iden-
tifier ranges thus do not scale. Group B can handle such
queries easily. However, it is more difficult to connect
the peers such that the resulting topology provides effi-
cient routing, small routing tables, and balanced routing
load.

  

Source: Aberer, Karl - Faculté Informatique et Communications, Ecole Polytechnique Fédérale de Lausanne

 

Collections: Computer Technologies and Information Sciences