Optimal adaptive broadcasting with a bounded fraction of faulty nodes

DOI10.1007/S004530010030MaRDI QIDQ1578389zbMATH OpenOpenAlexFDO

Authors N. Delaunay

Publication date 27 August 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s004530010030

zbMATH Keywords

broadcastingadaptive distributed fault diagnosiswhispering model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

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

Cited in

(9)

• FAST BROADCASTING WITH BYZANTINE FAULTS
• Simple and optimal randomized fault-tolerant rumor spreading
• Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication
• Optimal adaptive broadcasting with a bounded fraction of faulty nodes (extended abstract)
• scientific article; zbMATH DE number 1875436 (Why is no real title available?)
• Round robin is optimal for fault-tolerant broadcasting on wireless networks
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip
• Doing-it-all with bounded work and communication
• Information dissemination in distributed systems with faulty units

This page was built for publication: Optimal adaptive broadcasting with a bounded fraction of faulty nodes

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