| Abstract |
|
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 O(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 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-Bruijn topology.
|
 Additional Information
|
Index Terms- peer-to-peer, ditributed hashtable, De Bruijn topology
Citation:
Anh-Tuan Gai, Laurent Viennot,
"Broose: A Practical Distributed Hashtable Based on the De-Bruijn Topology,"
p2p,
pp. 167-164,
Fourth International Conference on Peer-to-Peer Computing (P2P'04),
2004
|
