Telephone problems with failures
SIAM Journal on Algebraic and Discrete Methods
On gossiping with faulty telephone lines
SIAM Journal on Algebraic and Discrete Methods
Broadcasting with random faults
Discrete Applied Mathematics
Journal of Algorithms
Introduction to algorithms
Journal of Algorithms
Sparse Networks Supporting Efficient Reliable Broadcasting
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Mobile Search for a Black Hole in an Anonymous Ring
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Linear multicasting in dynamic networks
Computer Communications
| Hi-index | 0.00 |
In linear broadcasting, packets originally stored in one node, called the source, have to visit all other nodes of the network. Every packet has a predetermined route indicating in which order it visits the nodes. A faulty link or node of the network destroys all packets passing through it. A linear broadcasting scheme consisting of packets' routes is f-fault-tolerant if every fault-free node is visited by at least one packet for any configuration of at most f link or node failures. We estimate the minimum number of packets for which there exists an f-fault-tolerant linear broadcasting scheme in complete networks, and we construct schemes using few packets. Variations of this problem when faults can occur only in links or only in nodes are also considered.