A new protection capacity allocation algorithm based on MST-DP for optical networks
暂无分享,去创建一个
In this paper, a novel protection capacity reservation algorithm is proposed for the link protection schemes in WDM (wavelength division multiplexing) mesh networks with dynamic traffic demands. The algorithm called MST-DP (Minimum Spanning Tree-Dynamic Programming) is given by combination with spanning tree and dynamic programming algorithm. In this scheme, a protection capacity tree is pre-planned based on MST-DP algorithm to assure that every node-pair on networks keep connection by at least two different protection routes. So the networks can be protected from any single link or node failure event through reserving protection capacities in the pre-planned protection capacity tree. This algorithm run in WDM optical network based on matrix model. Compared with other protection capacity reservation algorithm, such as p-cycle and redundant tree, MST-DP algorithm is more simple and easy to be realized. Simulation results indicate that the MST-DP protection scheme can improve network restorability and reduce service disruption ratio on the basis of fully utilizing resources of the network.
[1] Muriel Médard,et al. Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs , 1999, TNET.
[2] Jean-Yves Le Boudec,et al. Design protection for WDM optical networks , 1998, IEEE J. Sel. Areas Commun..
[3] Biswanath Mukherjee,et al. Survivable WDM mesh networks , 2003 .
[4] Oliver W. W. Yang,et al. Hierarchical Protection Tree Scheme for Failure Recovery in Mesh Networks , 2004, Photonic Network Communications.