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.
Complete list of metadatas

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00471714
Contributor : Laurent Viennot <>
Submitted on : Thursday, April 8, 2010 - 5:52:14 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Friday, October 19, 2012 - 11:26:20 AM

File

5238.pdf
Files produced by the author(s)

Identifiers

  • 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. ⟨inria-00471714⟩

Share

Metrics

Record views

187

Files downloads

172