Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
A Flexible WDM Ring Network Design and Dimensioning Methodology
ONDM '00 Proceedings of the IFIP TC6 Fourth Working Conference on Optical Network Design and Modeling: New Trends in Optical Network Design and Modeling
A simple dynamic integrated provisioning/protection scheme in IP over WDM networks
IEEE Communications Magazine
A framework for service-guaranteed shared protection in WDM mesh networks
IEEE Communications Magazine
Design of logical topologies for wavelength-routed optical networks
IEEE Journal on Selected Areas in Communications
Dimensioning of survivable WDM networks
IEEE Journal on Selected Areas in Communications
A highly efficient path-restoration protocol for management of optical network transport integrity
IEEE Journal on Selected Areas in Communications
Survivable lightpath routing: a new approach to the design of WDM-based networks
IEEE Journal on Selected Areas in Communications
Availability analysis of span-restorable mesh networks
IEEE Journal on Selected Areas in Communications
Comparison of k-shortest paths and maximum flow routing for network facility restoration
IEEE Journal on Selected Areas in Communications
IP restoration vs. WDM protection: is there an optimal choice?
IEEE Network: The Magazine of Global Internetworking
Lightpath routing for intelligent optical networks
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.24 |
Numerous researchers have proposed restoration techniques incorporating the concept of shortest disjoint paths in Wavelength Division Multiplexing (WDM) optical networks. The concept of shortest disjoint paths that obeys the strong optimal principle and the weak optimal principle is very important because shorter wavelength mileage including optical fiber distances is a dominant factor for the design of a survival WDM optical network. Even if restoration techniques incorporating the concept of shortest disjoint paths are faster, simpler, and easier than any other restoration techniques, we need to evaluate how well the concept of shortest disjoint paths is incorporated for the design of a survivable WDM optical network. In this paper, topology dependencies related to the concept of shortest disjoint paths are first developed. Then, seven objective functions that yield objective goals significant to the optimal design of a survivable WDM optical network are proposed and mathematically formulated. Finally, we develop ASDP (Near-Optimally Annealed k-Shortest Disjoint Path Restoration) and BBD (Branch-and-Bound with Dynamic Programming Principle) restoration algorithms that examine the proposed objective functions. Numerical results by experimenting ASDP and BBD algorithms show that the concept of shortest disjoint paths yields the best performance in terms of total and average restoration time. However, the concept of shortest disjoint paths does not seem to be an optimal technique in terms of significant optimal objective goals: minimal wavelengths, minimal wavelength link distance, minimal wavelength mileage costs, and even distribution of traffic flows.