Broadcasting with random faults

DOI10.1016/0166-218X(88)90037-6zbMath0658.05068OpenAlexW2045940022MaRDI QIDQ1111578

Bienstock, Daniel

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0166-218x(88)90037-6

zbMATH Keywords

communication networkmessagerandom edge faultstotal number of edges

Mathematics Subject Classification ID

Graph theory (05C99) Applications of graph theory to circuits and networks (94C15)

Related Items (13)

On optimal broadcasting in faulty hypercubes ⋮ Fast gossiping with short unreliable messages ⋮ Reliable broadcasting ⋮ Reliable broadcasting in product networks ⋮ Broadcasting with linearly bounded transmission faults ⋮ Broadcasting in hypercubes with randomly distributed Byzantine faults ⋮ Token transfer in a faulty network ⋮ Sparse networks supporting efficient reliable broadcasting ⋮ Broadcasting in complete networks with faulty nodes using unreliable calls ⋮ Reliable Broadcasting in Hypercubes with Random Link and Node Failures ⋮ Deterministic Models of Communication Faults ⋮ The diameter and connectivity of networks with random dependent faults ⋮ FAST BROADCASTING WITH BYZANTINE FAULTS

Cites Work

• Sorting in \(c \log n\) parallel steps
• Minimum broadcast graphs
• Fault-tolerant broadcast graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Broadcasting with random faults