Sparse networks supporting efficient reliable broadcasting

Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc

doi:10.1007/3-540-56939-1_88

Sparse networks supporting efficient reliable broadcasting

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

10 Scopus citations

Abstract

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 language	English (US)
Title of host publication	Automata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings
Editors	Andrzej Lingas, Rolf Karlsson, Svante Carlsson
Publisher	Springer Verlag
Pages	388-397
Number of pages	10
ISBN (Print)	9783540569398
DOIs	https://doi.org/10.1007/3-540-56939-1_88
State	Published - 1993
Externally published	Yes
Event	20th International Colloquium on Automata, Languages and Programming, ICALP 1993 - Lund, Sweden Duration: Jul 5 1993 → Jul 9 1993

Publication series

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

Conference

Conference	20th International Colloquium on Automata, Languages and Programming, ICALP 1993
Country/Territory	Sweden
City	Lund
Period	7/5/93 → 7/9/93

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-56939-1_88

Cite this

Chlebus, B. S., Diks, K., & Pelc, A. (1993). Sparse networks supporting efficient reliable broadcasting. In A. Lingas, R. Karlsson, & S. Carlsson (Eds.), Automata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings (pp. 388-397). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 700 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-56939-1_88

Sparse networks supporting efficient reliable broadcasting. / Chlebus, Bogdan S.; Diks, Krzysztof; Pelc, Andrzej.
Automata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings. ed. / Andrzej Lingas; Rolf Karlsson; Svante Carlsson. Springer Verlag, 1993. p. 388-397 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 700 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Chlebus, BS, Diks, K & Pelc, A 1993, Sparse networks supporting efficient reliable broadcasting. in A Lingas, R Karlsson & S Carlsson (eds), Automata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 700 LNCS, Springer Verlag, pp. 388-397, 20th International Colloquium on Automata, Languages and Programming, ICALP 1993, Lund, Sweden, 7/5/93. https://doi.org/10.1007/3-540-56939-1_88

Chlebus BS, Diks K, Pelc A. Sparse networks supporting efficient reliable broadcasting. In Lingas A, Karlsson R, Carlsson S, editors, Automata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings. Springer Verlag. 1993. p. 388-397. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-56939-1_88

Chlebus, Bogdan S. ; Diks, Krzysztof ; Pelc, Andrzej. / Sparse networks supporting efficient reliable broadcasting. Automata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings. editor / Andrzej Lingas ; Rolf Karlsson ; Svante Carlsson. Springer Verlag, 1993. pp. 388-397 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{cf99cfb4aeba484985bf9fe455fa1571,

title = "Sparse networks supporting efficient reliable broadcasting",

abstract = "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-ε. For any p0 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.",

author = "Chlebus, {Bogdan S.} and Krzysztof Diks and Andrzej Pelc",

note = "Funding Information: (1,2) partly supported by EC Cooperative Action IC-1000 (project ALTEC: Algorithms for Future Technologies). (2) partly supported by NSERC International Fellowship. (3) partly supported by NSERC grant OGP 0008136. Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1993.; 20th International Colloquium on Automata, Languages and Programming, ICALP 1993 ; Conference date: 05-07-1993 Through 09-07-1993",

year = "1993",

doi = "10.1007/3-540-56939-1_88",

language = "English (US)",

isbn = "9783540569398",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "388--397",

editor = "Andrzej Lingas and Rolf Karlsson and Svante Carlsson",

booktitle = "Automata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings",

}

TY - GEN

T1 - Sparse networks supporting efficient reliable broadcasting

AU - Chlebus, Bogdan S.

AU - Diks, Krzysztof

AU - Pelc, Andrzej

N1 - Funding Information: (1,2) partly supported by EC Cooperative Action IC-1000 (project ALTEC: Algorithms for Future Technologies). (2) partly supported by NSERC International Fellowship. (3) partly supported by NSERC grant OGP 0008136. Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1993.

PY - 1993

Y1 - 1993

N2 - 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-ε. For any p0 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.

AB - 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-ε. For any p0 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.

UR - http://www.scopus.com/inward/record.url?scp=21144480429&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=21144480429&partnerID=8YFLogxK

U2 - 10.1007/3-540-56939-1_88

DO - 10.1007/3-540-56939-1_88

M3 - Conference contribution

AN - SCOPUS:21144480429

SN - 9783540569398

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 388

EP - 397

BT - Automata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings

A2 - Lingas, Andrzej

A2 - Karlsson, Rolf

A2 - Carlsson, Svante

PB - Springer Verlag

T2 - 20th International Colloquium on Automata, Languages and Programming, ICALP 1993

Y2 - 5 July 1993 through 9 July 1993

ER -

Sparse networks supporting efficient reliable broadcasting

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this