A fail-safe layer for distributed network algorithms and changing topologies

We develop a method allowing an algorithm designed for fixed topologies to run on a network with changing topology. The method consists of building a "fail-safe layer" that acts as an interface between the algorithm and the communication network. The communication and time complexities of the method are O(V**2 E) and O(V log V) respectively.