Change search
ReferencesLink to record
Permanent link

Direct link
Self-Correcting Broadcast in Distributed Hash Tables
Show others and affiliations
Number of Authors: 5
2003 (English)Conference paper (Refereed)
Abstract [en]

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, 1. , 6 p.
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-13807OAI: diva2:1035089
15th International Conference Parallel and Distributed Computing and Systems (PDCS'2003)
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(619 kB)2 downloads
File information
File name FULLTEXT01.pdfFile size 619 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Other links


Search in DiVA

By author/editor
Ghodsi, AliEl-Ansary, Sameh
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link