Adaptive broadcasting with faulty nodes

DOI10.1016/0167-8191(96)00023-3MaRDI QIDQ671453zbMATH OpenOpenAlexFDO

Authors Leszek Gąsieniec, Andrzej Pelc

Publication date 27 February 1997

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(96)00023-3

zbMATH Keywords

AlgorithmsAdaptiveBroadcastingFault-tolerance

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Recommendations

• Optimal adaptive broadcasting with a bounded fraction of faulty nodes
• Optimal adaptive broadcasting with a bounded fraction of faulty nodes (extended abstract)
• Fault-tolerant broadcasting in radio networks
• Broadcasting with linearly bounded transmission faults

Cited in

(13)

• Rapid almost-complete broadcasting in faulty networks
• Minimum time broadcast in faulty star networks
• FAST BROADCASTING WITH BYZANTINE FAULTS
• Simple and optimal randomized fault-tolerant rumor spreading
• Broadcasting in complete networks with faulty nodes using unreliable calls
• Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
• Optimal adaptive broadcasting with a bounded fraction of faulty nodes (extended abstract)
• Deterministic Models of Communication Faults
• On Mixing and Edge Expansion Properties in Randomized Broadcasting
• Adaptive broadcast by fault-tolerant spanning tree switching
• On the runtime and robustness of randomized broadcasting
• On mixing and edge expansion properties in randomized broadcasting
• Fault-tolerant broadcasting in radio networks

This page was built for publication: Adaptive broadcasting with faulty nodes

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