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
A guided tour of Chernoff bounds
Information Processing Letters
Optimal and near-optimal broadcast in random graphs
Discrete Applied Mathematics
Almost safe gossiping in bounded degree networks
SIAM Journal on Discrete Mathematics
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Communication in networks with random dependent faults
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
Broadcasting concerns transmitting information from a node of a communication network to all other nodes. We consider this problem assuming that links and nodes of the network fail independently with given probabilities p q n-node network is said to be ε-safe, if source information is transmitted to all fault-free nodes with probability at least 1 - n-ε. For any p q 0 we show a class of n-node networks with maximum degree O(log n) and ε-safe broadcasting algorithms for such networks working in logarithmic time.