Abstract

An alternate routing algorithm requires a set of predetermined routing paths between each source-destination pair. To reduce the connection blocking probability, it is desirable that the predetermined routing paths between each source-destination pair be link-disjoint. The predetermined routing paths used in previous works on alternate routing are the $k$-shortest link-disjoint paths in terms of hop count. The shared links among the $k$-shortest link-disjoint paths between different source-destination pairs may cause high connection blocking probability. Thus, depending on the traffic requirements of all source-destination pairs, hop-count based $k$-shortest link-disjoint paths may not be the best choice for the predetermined routing paths. This paper proposes a method to find a set of link-disjoint routing paths between each source-destination pair to be used by an alternate routing algorithm in order to reduce the connection blocking probability. The key idea is to find a set of link-disjoint routing paths based on the routing paths that are utilized by the optimal traffic pattern in the network. Then, for each source-destination pair, we select a set of link-disjoint routing paths from the routing paths that are utilized by the optimal traffic pattern such that the selected set of link-disjoint routing paths carries the most of the traffic between the source-destination pair. Simulations are performed to compare the performance of using the link-disjoint routing paths found by the proposed method as the predetermined routing paths and those of using the hop-count based $k$-shortest link-disjoint paths and employing the routing paths found by the capacity-balanced alternate routing method proposed method by Ho and Mouftah (in 2002) as the predetermined routing paths. Our simulation results show that using the link-disjoint routing paths found by the proposed method yields significantly lower connection blocking probability than employing the hop-count based $k$-shortest link-disjoint paths and using the routing paths found by the capacity-balanced alternate routing method (Ho and Mouftah, 2002).

© 2008 IEEE

Priority Based Routing and Wavelength Assignment With Traffic Grooming for Optical Networks

Bijoy Chand Chatterjee, Nityananda Sarma, and Partha Pritim Sahu
J. Opt. Commun. Netw. 4(6) 480-489 (2012)

Routing and Wavelength Assignment of Static Manycast Demands Over All-Optical Wavelength-Routed WDM Networks

Neal Charbonneau and Vinod M. Vokkarane
J. Opt. Commun. Netw. 2(7) 442-455 (2010)

Tidal-Traffic-Aware Routing and Spectrum Allocation in Elastic Optical Networks

Boyuan Yan, Yongli Zhao, Xiaosong Yu, Wei Wang, Yu Wu, Ying Wang, and Jie Zhang
J. Opt. Commun. Netw. 10(11) 832-842 (2018)

Domain-Level-Based Routing Algorithm in Multidomain WDM Optical Network

Rui Lu, Xiaoping Zheng, and Nan Hua
J. Opt. Commun. Netw. 5(5) 532-543 (2013)

Survivable Inter-Domain Routing Based on Topology Aggregation With Intra-Domain Disjointness Information in Multi-Domain Optical Networks

Chengyi Gao, Hakki C. Cankaya, and Jason P. Jue
J. Opt. Commun. Netw. 6(7) 619-628 (2014)