Optimal adaptive broadcasting with a bounded fraction of faulty nodes

DOI10.1007/s004530010030zbMath0961.68015OpenAlexW2775875217MaRDI QIDQ1578389

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)

Related Items (5)

Simple and optimal randomized fault-tolerant rumor spreading ⋮ Breathe before speaking: efficient information dissemination despite noisy, limited and anonymous communication ⋮ Meeting the deadline: on the complexity of fault-tolerant continuous gossip ⋮ Doing-it-all with bounded work and communication ⋮ FAST BROADCASTING WITH BYZANTINE FAULTS

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