Broose: A Practical Distributed Hashtable Based on the De-Brujin 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.
Document type :
Complete list of metadatas
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 9:33:40 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Sunday, April 4, 2010 - 9:51:37 PM


  • HAL Id : inria-00070760, version 1



Anh-Tuan Gai, Laurent Viennot. Broose: A Practical Distributed Hashtable Based on the De-Brujin Topology. [Research Report] RR-5238, INRIA. 2004, pp.16. ⟨inria-00070760⟩



Record views


Files downloads