 
Summary: Applying Static Network Protocols to Dynamic Networks
Yehuda Afek \Lambda Baruch Awerbuch y Eli Gafni z
Abstract
This paper addresses the problem of how to adapt an algorithm designed for fixed topology networks
to produce the intended results, when run in a network whose topology changes dynamically, in
spite of encountering topological changes during its execution. We present a simple and unified
procedure, called a reset procedure, which, when combined with the static algorithm, achieves this
adaptation. The communication and time complexities of the reset procedure, per topological
change, are independent of the number of topological changes and are linearly bounded by the size
of the subset of the network which participates in the algorithm.
1 Introduction
Many distributed algorithms for data communica
tion networks have been developed in recent years
[AG85, GHS83, Awe85]. Most of these algorithms
are static; that is, they operate correctly under the
assumption that the network topology remains fixed
during the execution of the algorithm. Should the
network undergo a topological change in the midst
of execution, the results may be meaningless, even if
the algorithm terminates. Yet, real networks, such as
