Local fail-safe network reset procedure

Yehuda Afek, Baruch Awerbuch, Eli Gafni

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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 languageEnglish
Title of host publicationDistributed Algorithms - 2nd International Workshop, Proceedings
EditorsJ. van Leeuwen
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783540193661
StatePublished - 1988
Externally publishedYes
Event2nd International Workshop on Distributed Algorithms, WDAG 1987 - Amsterdam, Netherlands
Duration: 8 Jul 198710 Jul 1987

Publication series

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


Conference2nd International Workshop on Distributed Algorithms, WDAG 1987


Dive into the research topics of 'Local fail-safe network reset procedure'. Together they form a unique fingerprint.

Cite this