Reliable broadcasting

DOI10.1016/0166-218X(94)90181-3zbMath0807.94034MaRDI QIDQ1339885

Arthur L. Liestman, Joseph G. Peters, Luisa Gargano, D. S. Richards

Publication date: 5 March 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

networks; broadcasting; transmission failures

Mathematics Subject Classification ID

05C90: Applications of graph theory

90B18: Communication networks in operations research

94C15: Applications of graph theory to circuits and networks

Related Items

Communication complexity of fault-tolerant information diffusion, Minimum time broadcast in faulty star networks, Broadcasting in hypercubes and star graphs with dynamic faults., Deterministic Models of Communication Faults

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Broadcasting with random faults
• Broadcasting in a hypercube when some calls fail
• Broadcasting in complete networks with faulty nodes using unreliable calls
• On optimal broadcasting in faulty hypercubes
• Telephone Problems with Failures
• Fault-tolerant broadcast graphs
• A survey of gossiping and broadcasting in communication networks
• A group-theoretic model for symmetric interconnection networks
• Networks immune to isolated failures
• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Time bounds on fault‐tolerant broadcasting