Optimal time broadcasting in faulty star networks

DOI10.1007/3-540-61769-8_12MaRDI QIDQ6570918zbMATH OpenFDO

Authors Aohan Mei, Feng Bao, Yoshihide Igarashi

Publication date 11 July 2024

Full work available at URL https://doi.org/10.1007/3-540-61769-8_12

Mathematics Subject Classification ID

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

Recommendations

• Minimum time broadcast in faulty star networks
• Broadcasting in star graphs with Byzantine failures
• Time bounds on fault‐tolerant broadcasting
• Broadcasting in hypercubes and star graphs with dynamic faults.
• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults

Cites work

• A group-theoretic model for symmetric interconnection networks
• A note on optimal time broadcast in faulty hypercubes
• A survey of gossiping and broadcasting in communication networks
• Fault-tolerant broadcast graphs
• On Group Graphs and Their Fault Tolerance

Cited in

(1)

• Broadcasting in star graphs with Byzantine failures

This page was built for publication: Optimal time broadcasting in faulty star networks

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