Distributed network failure recovery with tie-sets

The present research attempts to recover network failure in complicated network topology by focusing on tie-sets. A tie-set implies a set of links constituting a cycle. Tie-sets enable entire networks to be divided into smaller local units of tie-sets which encompass all network vertices and links. These units realize network management for quick and flexible failure recovery. This paper first introduces the concept of tie-sets, and then proposes a recovery method for single link failure. The latter half of the paper deals with the efficacy of failure recovery in different spanning trees. In order to realize quick failure recovery, the paper also proposes a method of determining an optimal spanning tree.