Hierarchical routing in multi-domain optical networks
Computer Communications
A novel recursive shared segment protection algorithm in survivable WDM networks
Journal of Network and Computer Applications
Dynamic survivable algorithm for meshed WDM optical networks
Journal of Network and Computer Applications - Special issue: Network and information security: A computational intelligence approach
Distributed inter-domain lightpath provisioning in the presence of wavelength conversion
Computer Communications
Efficient path protection in bi-directional WDM systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Restoration in all-optical GMPLS networks with limited wavelength conversion
Computer Networks: The International Journal of Computer and Telecommunications Networking
Intelligent shared-segment protection
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new approach for designing fault-tolerant WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal segment size for fixed-sized segment protection in wavelength-routed optical networks
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
Availability formulations for segment protection
IEEE Transactions on Communications
Dynamic path shared protection for survivable differentiated reliable WDM optical networks
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
| Hi-index | 0.07 |
In this paper, a survivable routing algorithm is proposed for shared segment protection (SSP), called optimal self-healing loop allocation (OSHLA), which dynamically allocates spare capacity for a given working lightpath in mesh wavelength-division-multiplexing (WDM) networks with partial wavelength conversion capability. Two novel graph transformation approaches, namely graph of cycles and wavelength graph of paths, are introduced to solve this problem, in which the task of survivable routing is formulated as a series of shortest path searching processes. In addition to an analysis on the computation complexity, a suite of experiments is conducted to verify OSHLA on four networks with different topologies and traffic loads. We find that the blocking probability and computation complexity are dominated by the upper bound on the length of the working and protection segments. Comparison is made between OSHLA and four other reported schemes in terms of blocking probability. The results show that OSHLA can achieve the lowest blocking probability under the network environment of interest. We conclude that OSHLA provides a generalized framework of survivable routing for an efficient implementation of SSP in mesh WDM partial wavelength convertible networks. With OSHLA, a compromise is initiated by manipulating the upper bound on the length of working and protection segments such that the best performance-computation complexity gain can be achieved.