SELF-REPAIRING NETWORKS

Abstract

In this paper, we provide a specification for a class of communication networks that are immune to single site failures, not only maintaining the ability to transfer messages between operable sites but doing so with no additional delay (i.e. no increase in length of communication path). We call these networks self-repairing and refer to their underlying topologies as self-repairing graphs. Our specification includes a constructive characterization of a class of minimal self-repairing graphs and an algorithmic determination of associated routing tables that can be used by a simple message transfer procedure to realize the desired immune behavior.