Abstract

In this paper, we consider the problem of determining primary and backup paths for survivable optical wavelength-division multiplexed mesh networks. We propose a distributed routing mechanism, which is called Least Resource Consumption Routing, that tries to minimize the combined cost of the primary and the backup paths. The proposed cost model includes the effect of various factors such as mean load, variance of the load on the route, number of converters required by the route, and the length of the route. Further, we model the route cost in such a way that it is extensible to include any new parameters and vary their relative importance. The performance studies conducted for the 14-node National Science Foundation Network and a 30-node topology show that the proposed scheme leads to significant improvements in blocking probability at low and moderate loads. Further, the proposed cost model also reduces the number of converters required to obtain a target blocking performance as compared to some other techniques proposed in the literature.

© 2007 IEEE

A new heuristic algorithm with shared segment-backup paths for trap avoidance in survivable optical networks

Lei Guo, Lemin Li, Jin Cao, and Hongfang Yu
Opt. Express 14(23) 10990-10995 (2006)

Joint routing-selection algorithm for a shared path with differentiated reliability in survivable wavelength-division-multiplexing mesh networks

Lei Guo, Hongfang Yu, and Lemin Li
Opt. Express 12(11) 2327-2337 (2004)

Inter-domain routing based on simulated annealing algorithm in optical mesh networks

Lei Wang, Hanyi Zhang, and Xiaoping Zheng
Opt. Express 12(14) 3095-3107 (2004)

Anycast Routing for Survivable Optical Grids: Scalable Solution Methods and the Impact of Relocation

Ali Shaikh, Jens Buysse, Brigitte Jaumard, and Chris Develder
J. Opt. Commun. Netw. 3(9) 767-779 (2011)

Minimized Spectrum Resource Consumption With Rescaled Failure Probability Constraint in Flexible Bandwidth Optical Networks

Jie Zhang, Bowen Chen, Yongli Zhao, Haining Chen, Wei Zhang, Xin Li, Jason P. Jue, Shanguo Huang, and Wanyi Gu
J. Opt. Commun. Netw. 5(9) 980-993 (2013)