Waking up an anonymous faulty network from a single source

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc

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

Abstract

We consider anonymous complete networks whose links and nodes are subject to random independent failures with fixed probabilities p<1 and q<1, respectively. A single fault-free node has to wake up all fault-free nodes by propagating a wakeup message through the network. In a unit of time each node can communicate with at most one other node. Communications with a faulty node or via a faulty link do not succeed. For any ε>0 we present a wakeup algorithm for n-node networks, running in expected time O(log n), using an expected number of O(n log n) message bits and working correctly with probability exceeding 1-n, for sufficiently large n. It is proved that these orders of magnitude are optimal.

Original languageEnglish (US)
Title of host publicationProceedings of the Hawaii International Conference on System Sciences
EditorsJay F. Nunamaker, Ralph H.Jr. Sprague
PublisherPubl by IEEE
Pages187-193
Number of pages7
ISBN (Print)0818650605
StatePublished - Jan 1 1994
Externally publishedYes
EventProceedings of the 27th Hawaii International Conference on System Sciences (HICSS-27). Part 4 (of 5) - Wailea, HI, USA
Duration: Jan 4 1994Jan 7 1994

Publication series

NameProceedings of the Hawaii International Conference on System Sciences
Volume2
ISSN (Print)1060-3425

Conference

ConferenceProceedings of the 27th Hawaii International Conference on System Sciences (HICSS-27). Part 4 (of 5)
CityWailea, HI, USA
Period1/4/941/7/94

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Chlebus, B. S., Diks, K., & Pelc, A. (1994). Waking up an anonymous faulty network from a single source. In J. F. Nunamaker, & R. H. J. Sprague (Eds.), Proceedings of the Hawaii International Conference on System Sciences (pp. 187-193). (Proceedings of the Hawaii International Conference on System Sciences; Vol. 2). Publ by IEEE.

Waking up an anonymous faulty network from a single source. / Chlebus, Bogdan S.; Diks, Krzysztof; Pelc, Andrzej.

Proceedings of the Hawaii International Conference on System Sciences. ed. / Jay F. Nunamaker; Ralph H.Jr. Sprague. Publ by IEEE, 1994. p. 187-193 (Proceedings of the Hawaii International Conference on System Sciences; Vol. 2).

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

Chlebus, BS, Diks, K & Pelc, A 1994, Waking up an anonymous faulty network from a single source. in JF Nunamaker & RHJ Sprague (eds), Proceedings of the Hawaii International Conference on System Sciences. Proceedings of the Hawaii International Conference on System Sciences, vol. 2, Publ by IEEE, pp. 187-193, Proceedings of the 27th Hawaii International Conference on System Sciences (HICSS-27). Part 4 (of 5), Wailea, HI, USA, 1/4/94.
Chlebus BS, Diks K, Pelc A. Waking up an anonymous faulty network from a single source. In Nunamaker JF, Sprague RHJ, editors, Proceedings of the Hawaii International Conference on System Sciences. Publ by IEEE. 1994. p. 187-193. (Proceedings of the Hawaii International Conference on System Sciences).
Chlebus, Bogdan S. ; Diks, Krzysztof ; Pelc, Andrzej. / Waking up an anonymous faulty network from a single source. Proceedings of the Hawaii International Conference on System Sciences. editor / Jay F. Nunamaker ; Ralph H.Jr. Sprague. Publ by IEEE, 1994. pp. 187-193 (Proceedings of the Hawaii International Conference on System Sciences).
@inproceedings{c797256c6c9742e6b176063445718cdc,
title = "Waking up an anonymous faulty network from a single source",
abstract = "We consider anonymous complete networks whose links and nodes are subject to random independent failures with fixed probabilities p<1 and q<1, respectively. A single fault-free node has to wake up all fault-free nodes by propagating a wakeup message through the network. In a unit of time each node can communicate with at most one other node. Communications with a faulty node or via a faulty link do not succeed. For any ε>0 we present a wakeup algorithm for n-node networks, running in expected time O(log n), using an expected number of O(n log n) message bits and working correctly with probability exceeding 1-n-ε, for sufficiently large n. It is proved that these orders of magnitude are optimal.",
author = "Chlebus, {Bogdan S.} and Krzysztof Diks and Andrzej Pelc",
year = "1994",
month = "1",
day = "1",
language = "English (US)",
isbn = "0818650605",
series = "Proceedings of the Hawaii International Conference on System Sciences",
publisher = "Publ by IEEE",
pages = "187--193",
editor = "Nunamaker, {Jay F.} and Sprague, {Ralph H.Jr.}",
booktitle = "Proceedings of the Hawaii International Conference on System Sciences",

}

TY - GEN

T1 - Waking up an anonymous faulty network from a single source

AU - Chlebus, Bogdan S.

AU - Diks, Krzysztof

AU - Pelc, Andrzej

PY - 1994/1/1

Y1 - 1994/1/1

N2 - We consider anonymous complete networks whose links and nodes are subject to random independent failures with fixed probabilities p<1 and q<1, respectively. A single fault-free node has to wake up all fault-free nodes by propagating a wakeup message through the network. In a unit of time each node can communicate with at most one other node. Communications with a faulty node or via a faulty link do not succeed. For any ε>0 we present a wakeup algorithm for n-node networks, running in expected time O(log n), using an expected number of O(n log n) message bits and working correctly with probability exceeding 1-n-ε, for sufficiently large n. It is proved that these orders of magnitude are optimal.

AB - We consider anonymous complete networks whose links and nodes are subject to random independent failures with fixed probabilities p<1 and q<1, respectively. A single fault-free node has to wake up all fault-free nodes by propagating a wakeup message through the network. In a unit of time each node can communicate with at most one other node. Communications with a faulty node or via a faulty link do not succeed. For any ε>0 we present a wakeup algorithm for n-node networks, running in expected time O(log n), using an expected number of O(n log n) message bits and working correctly with probability exceeding 1-n-ε, for sufficiently large n. It is proved that these orders of magnitude are optimal.

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

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

M3 - Conference contribution

AN - SCOPUS:0028014774

SN - 0818650605

T3 - Proceedings of the Hawaii International Conference on System Sciences

SP - 187

EP - 193

BT - Proceedings of the Hawaii International Conference on System Sciences

A2 - Nunamaker, Jay F.

A2 - Sprague, Ralph H.Jr.

PB - Publ by IEEE

ER -