Broose: a practical distributed hashtable based on the de-Bruijn topology

Broose is a peer-to-peer protocol based on the de Bruijn 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 0(k) contacts for allowing lookups in O(log N) message exchange (where N is the number of nodes participating). It can also be parameterized for obtaining O(log N / log log N) steps lookups with a routing table of size 0(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 Bruijn topology.