scientific article; zbMATH DE number 751136

MaRDI QIDQ4764627zbMATH OpenFDO

Authors Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc

Publication date 4 May 1995

zbMATH Keywords

broadcasting algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18)

Recommendations

• Sparse networks supporting efficient reliable broadcasting
• scientific article; zbMATH DE number 4053528
• Sparse communication networks and efficient routing in the plane
• Sparse broadcast graphs
• Rapid Almost-Complete Broadcasting in Faulty Networks
• Rapid almost-complete broadcasting in faulty networks
• Sparse communication networks and efficient routing in the plane (extended abstract)
• Some simple distributed algorithms for sparse networks
• Network coding-based reliable multicast in wireless networks

Cited in

(12)

• Broadcasting with random faults
• Broadcasting in complete networks with faulty nodes using unreliable calls
• Reliable broadcasting
• Reliable broadcasting in product networks
• Broadcasting with linearly bounded transmission faults
• The diameter and connectivity of networks with random dependent faults
• Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
• FAST BROADCASTING WITH BYZANTINE FAULTS
• Optimal communication in networks with randomly distributed byzantine faults
• Sparse networks supporting efficient reliable broadcasting
• Token transfer in a faulty network
• Feasibility and complexity of broadcasting with random transmission failures

This page was built for publication:

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