Tight bounds for FEC-based reliable multicast

DOI10.1016/J.IC.2003.12.005MaRDI QIDQ598189zbMATH OpenOpenAlexFDO

Authors Hagit Attiya, Hadas Shachnai

Publication date 6 August 2004

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2003.12.005

zbMATH Keywords

Error-correcting codesLower boundsRandomized distributed algorithmsReliable multicast

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Communication theory (94A05)

Recommendations

• Reliable broadcasts and communication models: tradeoffs and lower bounds
• scientific article; zbMATH DE number 2080546
• Network coding-based reliable multicast in wireless networks
• Time bounds on fault‐tolerant broadcasting
• scientific article; zbMATH DE number 3946031
• Bounds and Protocols for a Rate-Constrained Relay Channel
• Bounds on the capacity of FCFS multiple-access algorithms
• Tight bounds for MIS in multichannel radio networks
• Stable Throughput for Multicast With Random Linear Coding
• Reliability evaluation of a multicast over coded packet networks

Cites work

• An \Omega(D\log (N/D)) Lower Bound for Broadcast in Radio Networks
• Efficient dispersal of information for security, load balancing, and fault tolerance
• scientific article; zbMATH DE number 53883 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 873409 (Why is no real title available?)

Cited in

(2)

• Active node based reliable multicast error control
• scientific article; zbMATH DE number 2080794 (Why is no real title available?)

Describes a project that uses

Uses Software

• Horus

This page was built for publication: Tight bounds for FEC-based reliable multicast

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598189)