A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices
IEEE Transactions on Computers
Surviving Multiple Network Failures Using Shared Backup Path Protection
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Dynamic Shared-Path Protection Algorithm for Dual-Risk Failures in WDM Mesh Networks
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels
IEEE/ACM Transactions on Networking (TON)
IEEE Journal on Selected Areas in Communications
Hi-index | 0.01 |
In this paper, we propose a novel heuristic survivable algorithm called dynamic path-shared protection (DPSP) to completely protect the double-link failures in meshed Wavelength-division-multiplexing (WDM) optical networks. In order to improve the algorithm performance, we focus on considering two key issues that are load balancing and resource-sharing degree when computing the working and backup paths. We also investigate the trap situations and present a solution method, because the trap situations may lead to high blocking probability (BP). Simulations results show that, DPSP can provide complete protection for the double-link failures; with respect to the previous work, DPSP not only can effectively avoid the trap situations but also is able to obtain higher resource utilization ratio and lower BP.