Local fail-safe network reset procedure

Yehuda Afek; Baruch Awerbuch; Eli Gafni

doi:10.1007/BFb0019805

Local fail-safe network reset procedure

Yehuda Afek, Baruch Awerbuch, Eli Gafni

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

Abstract

A simple, general and optimal procedure to adapt algorithms designed for fixed topology networks to run on a network with dynamically changing topology is presented. The communication and time complexities of the procedure, per topological change, are independent of the number of topological changes and are linearly bounded by the size of the subnetwork over which the algorithm is running.

Original language	English
Title of host publication	Distributed Algorithms - 2nd International Workshop, Proceedings
Editors	J. van Leeuwen
Publisher	Springer Verlag
Pages	197-211
Number of pages	15
ISBN (Print)	9783540193661
DOIs	https://doi.org/10.1007/BFb0019805
State	Published - 1988
Externally published	Yes
Event	2nd International Workshop on Distributed Algorithms, WDAG 1987 - Amsterdam, Netherlands Duration: 8 Jul 1987 → 10 Jul 1987

Publication series

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

Conference

Conference	2nd International Workshop on Distributed Algorithms, WDAG 1987
Country/Territory	Netherlands
City	Amsterdam
Period	8/07/87 → 10/07/87

Access to Document

10.1007/BFb0019805

Cite this

Afek, Y., Awerbuch, B., & Gafni, E. (1988). Local fail-safe network reset procedure. In J. van Leeuwen (Ed.), Distributed Algorithms - 2nd International Workshop, Proceedings (pp. 197-211). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 312 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0019805

@inproceedings{49a3820d90334474af6f83b3385adb70,

title = "Local fail-safe network reset procedure",

abstract = "A simple, general and optimal procedure to adapt algorithms designed for fixed topology networks to run on a network with dynamically changing topology is presented. The communication and time complexities of the procedure, per topological change, are independent of the number of topological changes and are linearly bounded by the size of the subnetwork over which the algorithm is running.",

author = "Yehuda Afek and Baruch Awerbuch and Eli Gafni",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1988.; 2nd International Workshop on Distributed Algorithms, WDAG 1987 ; Conference date: 08-07-1987 Through 10-07-1987",

year = "1988",

doi = "10.1007/BFb0019805",

language = "אנגלית",

isbn = "9783540193661",

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

publisher = "Springer Verlag",

pages = "197--211",

editor = "{van Leeuwen}, J.",

booktitle = "Distributed Algorithms - 2nd International Workshop, Proceedings",

}

Afek, Y, Awerbuch, B & Gafni, E 1988, Local fail-safe network reset procedure. in J van Leeuwen (ed.), Distributed Algorithms - 2nd International Workshop, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 312 LNCS, Springer Verlag, pp. 197-211, 2nd International Workshop on Distributed Algorithms, WDAG 1987, Amsterdam, Netherlands, 8/07/87. https://doi.org/10.1007/BFb0019805

Local fail-safe network reset procedure. / Afek, Yehuda; Awerbuch, Baruch; Gafni, Eli.
Distributed Algorithms - 2nd International Workshop, Proceedings. ed. / J. van Leeuwen. Springer Verlag, 1988. p. 197-211 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 312 LNCS).

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

TY - GEN

T1 - Local fail-safe network reset procedure

AU - Afek, Yehuda

AU - Awerbuch, Baruch

AU - Gafni, Eli

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1988.

PY - 1988

Y1 - 1988

N2 - A simple, general and optimal procedure to adapt algorithms designed for fixed topology networks to run on a network with dynamically changing topology is presented. The communication and time complexities of the procedure, per topological change, are independent of the number of topological changes and are linearly bounded by the size of the subnetwork over which the algorithm is running.

AB - A simple, general and optimal procedure to adapt algorithms designed for fixed topology networks to run on a network with dynamically changing topology is presented. The communication and time complexities of the procedure, per topological change, are independent of the number of topological changes and are linearly bounded by the size of the subnetwork over which the algorithm is running.

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

U2 - 10.1007/BFb0019805

DO - 10.1007/BFb0019805

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85035801924

SN - 9783540193661

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

SP - 197

EP - 211

BT - Distributed Algorithms - 2nd International Workshop, Proceedings

A2 - van Leeuwen, J.

PB - Springer Verlag

T2 - 2nd International Workshop on Distributed Algorithms, WDAG 1987

Y2 - 8 July 1987 through 10 July 1987

ER -

Local fail-safe network reset procedure

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this