Abstract

In this paper, we study shortest-path routing in wavelength-routed optical networks with an objective to optimize the average-case running time for path computation. Four fast routing algorithms are proposed for dynamically computing the shortest lightpaths or semilightpaths in a network with or without wavelength converters. To reduce the average-case running time for path computation, sequential search, backward routing, and informed search are used in the algorithm design. Simulation results show that the proposed algorithms can significantly reduce the average-case computational overhead for path computation as compared with existing algorithms.

© 2008 IEEE

Establishment of Dynamic Lightpaths in Filterless Optical Networks

Guillaume Mantelet, Andrew Cassidy, Christine Tremblay, David V. Plant, Paul Littlewood, and Michel P. Bélanger
J. Opt. Commun. Netw. 5(9) 1057-1065 (2013)

Wavelength-Routed Networks With Lightpath Data Interchanges

C. Y. Li, Lin Cai, P. K.A. Wai, Victor O.K. Li, and Anshi Xu
J. Opt. Commun. Netw. 2(7) 415-426 (2010)

Lightpath Establishment Assisted by Offline QoT Estimation in Transparent Optical Networks

Nicola Sambo, Yvan Pointurier, Filippo Cugini, Luca Valcarenghi, Piero Castoldi, and Ioannis Tomkos
J. Opt. Commun. Netw. 2(11) 928-937 (2010)

Lightpath- and Light-Tree-Based Groupcast Routing and Wavelength Assignment in Mesh Optical Networks

Tanvir Rahman, Georgios Ellinas, and Mohamed Ali
J. Opt. Commun. Netw. 1(2) A44-A55 (2009)

Scalable software-defined optical networking with high-performance routing and wavelength assignment algorithms

Chankyun Lee, Xiaoyuan Cao, Noboru Yoshikane, Takehiro Tsuritani, and June-Koo Kevin Rhee
Opt. Express 23(21) 27354-27360 (2015)