Sparse networks supporting efficient reliable broadcasting

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Scopus citations


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<l and q<l, respectively. For a positive constant e, broadcasting in an n-node network is said to be e-safe, if source information is transmitted to all fault-free nodes with probability at least 1-n. For any p<l, q<l and ε>0 we show a class of n-node networks with maximum degree O(log n) and e-safe broadcasting algorithms for such networks working in logarithmic time.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings
EditorsAndrzej Lingas, Rolf Karlsson, Svante Carlsson
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540569398
StatePublished - 1993
Externally publishedYes
Event20th International Colloquium on Automata, Languages and Programming, ICALP 1993 - Lund, Sweden
Duration: Jul 5 1993Jul 9 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume700 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference20th International Colloquium on Automata, Languages and Programming, ICALP 1993

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Sparse networks supporting efficient reliable broadcasting'. Together they form a unique fingerprint.

Cite this