28th Annual Symposium on Foundations of Computer Science (sfcs 1987) (1987)
Oct. 12, 1987 to Oct. 14, 1987
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SFCS.1987.7
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.
E. Gafni, Y. Afek and B. Awerbuch, "Applying static network protocols to dynamic networks," 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)(FOCS), vol. 00, no. , pp. 358-370, 1987.