Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
On de Bruijn routing in distributed hash tables: There and back again Anwitaman Datta, Sarunas Girdzijauskas, Karl Aberer
 

Summary: On de Bruijn routing in distributed hash tables: There and back again
Anwitaman Datta, Sarunas Girdzijauskas, Karl Aberer
School of Computer and Communication Sciences
Swiss Federal Institute of Technology Lausanne (EPFL)
CH-1015 Lausanne, Switzerland
Email: {anwitaman.datta, sarunas.girdzijauskas, karl.aberer}@epfl.ch
Abstract
We show in this paper that de Bruijn networks, despite
providing efficient search while using constant routing ta-
ble size, as well as simplicity of the understanding and im-
plementation of such networks, are unsuitable where key
distribution will be uneven, a realistic scenario for most
practical applications. In presence of arbitrarily skewed
data distribution, it has only recently been shown that some
traditional P2P overlay networks with non-constant (typi-
cally logarithmic) instead of constant routing table size can
meet conflicting objectives of storage load balancing as well
as search efficiency. So this paper, while showing that de
Bruijn networks fail to meet these dual objectives, opens
up a more general problem for the research community as

  

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

 

Collections: Computer Technologies and Information Sciences