Optimal adaptive broadcasting with a bounded fraction of faulty nodes (extended abstract)

DOI10.1007/3-540-63397-9_10MaRDI QIDQ826079zbMATH OpenOpenAlexFDO

Authors Krzysztof Diks, Andrzej Pelc

Publication date 20 December 2021

Full work available at URL https://doi.org/10.1007/3-540-63397-9_10

zbMATH Keywords

broadcasting algorithmfault diagnosisfaulty nodefaulty processorleader election

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Recommendations

• Optimal adaptive broadcasting with a bounded fraction of faulty nodes
• Communication-efficient broadcasting in complete networks with dynamic faults
• Adaptive broadcasting with faulty nodes
• Fault-tolerant broadcasting in radio networks
• Efficient broadcasting with linearly bounded faults

Cited in

(5)

• Optimal adaptive broadcasting with a bounded fraction of faulty nodes
• Round robin is optimal for fault-tolerant broadcasting on wireless networks
• Information dissemination in distributed systems with faulty units
• scientific article; zbMATH DE number 1875436 (Why is no real title available?)
• Adaptive broadcasting with faulty nodes

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

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