Broose: A Practical Distributed Hashtable Based on the De-Bruijn Topology - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Broose: A Practical Distributed Hashtable Based on the De-Bruijn Topology

Résumé

Broose is a peer-to-peer protocol based on the De-Brujin 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 parametrized 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 De-Brujin topology.
Fichier principal
Vignette du fichier
5238.pdf (313.7 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00471714 , version 1 (08-04-2010)

Identifiants

  • HAL Id : inria-00471714 , version 1

Citer

Anh-Tuan Gai, Laurent Viennot. Broose: A Practical Distributed Hashtable Based on the De-Bruijn Topology. Proceedings of the 4th International Conference on Peer-to-Peer Computing (P2P), 2004, Zurich, Switzerland. pp.167-174. ⟨inria-00471714⟩

Collections

INRIA INRIA2
76 Consultations
186 Téléchargements

Partager

Gmail Facebook X LinkedIn More