Sciweavers

ICALP
1993
Springer

Sparse Networks Supporting Efficient Reliable Broadcasting

14 years 3 months ago
Sparse Networks Supporting Efficient Reliable Broadcasting
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 < 1 and q < 1, respectively. For a positive constant ε, broadcasting in an 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 < 1, q < 1 and ε > 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.
Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
Added 09 Aug 2010
Updated 09 Aug 2010
Type Conference
Year 1993
Where ICALP
Authors Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
Comments (0)