A New Path Restoration Algorithm in Networks

摘要

Spare capacity design is the most important component in a survivable network design. Its main purpose is to provide cost-efficient spare capacity reservation at certain sur-vivability level. In this paper, we introduce a new preplanned path restoration algorithm for spare capacity design in mesh-like networks. This is a spanning tree based algorithm with backup parents and some extra cycle edges. Simulation results show that our new algorithm achieves much better restorability than the well known hierarchical tree algorithm. The time complexity of the tree construction of the new algorithm is O(n~3), where n is the total number of nodes in the network.