Self-Correcting Broadcast in Distributed Hash Tables
2003 (English)In: Proceedings of the Fifteenth IASTED International Conference on Parallel and Distributed Computing and Systems / [ed] Gonzalez, T., 2003, 93-98 p.Conference paper (Refereed)
We present two broadcast algorithms that can be used on top of distributed hash tables (DHTs) to perform group communication and arbitrary queries. Unlike other P2P group communication mechanisms, which either embed extra information in the DHTs or use random overlay networks, our algorithms take advantage of the structured DHT overlay networks without maintaining additional information. The proposed algorithms do not send any redundant messages. Furthermore the two algorithms ensure 100% coverage of the nodes in the system even when routing information is outdated as a result of dynamism in the network. The first algorithm performs some correction of outdated routing table entries with a low cost of correction traffic. The second algorithm exploits the nature of the broadcasts to extensively update erroneous routing information at the cost of higher correction traffic. The algorithms are validated and evaluated in our stochastic distributed-algorithms simulator.
Place, publisher, year, edition, pages
2003. 93-98 p.
Distributed Algorithms, Distributed Hash Tables, Group Communication, Peer-to-Peer
IdentifiersURN: urn:nbn:se:kth:diva-25089ISBN: 0-88986-392-XOAI: oai:DiVA.org:kth-25089DiVA: diva2:355734
QC 201010082010-10-082010-10-082010-10-08Bibliographically approved