Tight bounds for FEC-based reliable multicast

We study the problem of reliable multicast of a message to a set of receivers over a network that uses best effort transmission (e.g., ATM), based on forward error correcting codes (FEC). We prove lower bounds on the time and message complexities of any algorithm for the problem. We present a synchr...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information and computation Jg. 190; H. 2; S. 117 - 135
Hauptverfasser: Attiya, Hagit, Shachnai, Hadas
Format: Journal Article
Sprache:Englisch
Veröffentlicht: San Diego, CA Elsevier Inc 01.05.2004
Elsevier
Schlagworte:
Applied sciences
Computer science; control theory; systems
Error-correcting codes
Exact sciences and technology
Lower bounds
Miscellaneous
Randomized distributed algorithms
Reliable multicast
Theoretical computing
Error-correcting codes
Lower bounds
Reliable multicast
Randomized distributed algorithms
Computer theory
ISSN:0890-5401, 1090-2651
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study the problem of reliable multicast of a message to a set of receivers over a network that uses best effort transmission (e.g., ATM), based on forward error correcting codes (FEC). We prove lower bounds on the time and message complexities of any algorithm for the problem. We present a synchronous randomized algorithm which guarantees the reliable multicast of a packet of size m to n receivers within O(log n) steps, and whose expected message complexity is O(log m). Its storage complexity is linear in the size of the original packet. The average message and time complexities of the algorithm are within a constant multiplicative factor of the lower bounds.
ISSN:0890-5401
1090-2651
DOI:10.1016/j.ic.2003.12.005