A guided tour of Chernoff bounds
Information Processing Letters
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Novel architectures for P2P applications: the continuous-discrete approach
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
P2P Networking and Applications
P2P Networking and Applications
State of the art and challenges on peer-to-peer simulators
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Theory and network applications of balanced kautz tree structures
ACM Transactions on Internet Technology (TOIT)
CDACAN: a scalable structured P2P network based on continuous discrete approach and CAN
HPCC'07 Proceedings of the Third international conference on High Performance Computing and Communications
| Hi-index | 0.00 |
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.