A tree-based link protection algorithm

High-speed network needs efficient protection scheme. This paper studies the tree-based link protection and restoration method in optical mesh network. Two logical trees can be overlain on a physical network for protection of the physical links and nodes. The nontree links are protected by either of the trees, while the tree links can be protected by one or both trees. A new algorithm is presented here on how to build two trees on a physical network. These two trees can share the same edge if their directions are different, thus reducing the overall restoration capacity, and minimizing the network total cost. Performance analysis of the algorithm executed in some existing network is presented. We can show that with this scheme the time complexity will reduce compared with the two-stage P-cycle optimization method. Also, in the best case, this scheme can get the optimization restorability result.