Broadcasting in hypercubes with randomly distributed Byzantine faults

DOI10.1007/bfb0022149zbMath1524.68012MaRDI QIDQ6084558

Yoshihide Igarashi, Feng Bao, Unnamed Author

Publication date: 1 December 2023

Published in: Distributed Algorithms (Search for Journal in Brave)

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Broadcasting with random faults
• Broadcasting in a hypercube when some calls fail
• A survey of gossiping and broadcasting in communication networks
• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
• Reliable communication in networks with Byzantine link failures
• Optimal communication in networks with randomly distributed byzantine faults
• Sparse networks supporting efficient reliable broadcasting
• Fault—tolerant hypercube broadcasting via information dispersal

This page was built for publication: Broadcasting in hypercubes with randomly distributed Byzantine faults