Broadcasting with linearly bounded transmission faults

DOI10.1016/S0166-218X(97)00107-8zbMath0901.68010OpenAlexW2088350826MaRDI QIDQ1392531

Andrzej Pelc, Leszek Gąsieniec

Publication date: 19 November 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

broadcasting

Mathematics Subject Classification ID

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

Related Items (5)

A note on broadcasting with linearly bounded transmission faults in constant degree networks ⋮ Agreement in synchronous networks with ubiquitous faults ⋮ Deterministic Models of Communication Faults ⋮ Rapid almost-complete broadcasting in faulty networks ⋮ Efficient broadcasting with linearly bounded faults

Cites Work

• Unnamed Item
• Optimal and near-optimal broadcast in random graphs
• Broadcasting with random faults
• Searching with known error probability
• Broadcasting in a hypercube when some calls fail
• Methods and problems of communication in usual networks
• On Gossiping with Faulty Telephone Lines
• Telephone Problems with Failures
• Fault-tolerant broadcast graphs
• A survey of gossiping and broadcasting in communication networks
• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Almost Safe Gossiping in Bounded Degree Networks
• Time bounds on fault‐tolerant broadcasting
• Broadcasting in synchronous networks with dynamic faults

This page was built for publication: Broadcasting with linearly bounded transmission faults