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

Abstract : 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.
Type de document :
Communication dans un congrès
Proceedings of the 4th International Conference on Peer-to-Peer Computing (P2P), 2004, Zurich, Switzerland. pp.167-174, 2004
Liste complète des métadonnées

Littérature citée [1 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00471714
Contributeur : Laurent Viennot <>
Soumis le : jeudi 8 avril 2010 - 17:52:14
Dernière modification le : vendredi 25 mai 2018 - 12:02:03
Document(s) archivé(s) le : vendredi 19 octobre 2012 - 11:26:20

Fichier

5238.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00471714, version 1

Collections

Citation

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, 2004. 〈inria-00471714〉

Partager

Métriques

Consultations de la notice

179

Téléchargements de fichiers

147