Feasibility and complexity of broadcasting with random transmission failures
From MaRDI portal
Publication:868959
DOI10.1016/j.tcs.2006.10.031zbMath1118.68017OpenAlexW2086236932MaRDI QIDQ868959
Publication date: 26 February 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.031
message passingbroadcastingradio networksrandom failuresmalicious transmission failuresnode-omission failures
Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (3)
Optimal gossiping in geometric radio networks in the presence of dynamical faults ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ \(f\)-sensitivity distance oracles and routing schemes
Cites Work
- Unnamed Item
- A guided tour of Chernoff bounds
- A lower bound for radio broadcast
- On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization
- Fault-Tolerant Broadcasting in Radio Networks
- Slide—The Key to Polynomial End-to-End Communication
- Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
- The Byzantine generals strike again
- Almost Safe Gossiping in Bounded Degree Networks
- The impossibility of implementing reliable communication in the face of crashes
- Optimal communication in networks with randomly distributed byzantine faults
- Information dissemination in distributed systems with faulty units
- Time of Deterministic Broadcasting in Radio Networks with Local Knowledge
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Broadcasting algorithms in radio networks with unknown topology
- Broadcast in radio networks tolerating byzantine adversarial behavior
- Fault-tolerant broadcasting and gossiping in communication networks
This page was built for publication: Feasibility and complexity of broadcasting with random transmission failures
