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

DOI10.1007/3-540-63397-9_10zbMATH Open1477.68038OpenAlexW2173651310MaRDI QIDQ826079FDOQ826079

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

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

zbMATH Keywords

leader electionfault diagnosisfaulty nodebroadcasting algorithmfaulty processor

Mathematics Subject Classification ID

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

Cited In (3)

• Round robin is optimal for fault-tolerant broadcasting on wireless networks
• Title not available (Why is that?)
• Information dissemination in distributed systems with faulty units

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)