Fast Routing Algorithms for Lightpath Establishment in Wavelength-Routed Optical Networks

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 wit...

Full description

Saved in:
Bibliographic Details
Published in:Journal of lightwave technology 2008-07, Vol.26 (13), p.1744-1751
Main Authors: Baoxian Zhang, Jun Zheng, Mouftah, H.T.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Applied sciences
Computation
Computational modeling
Computer networks
Exact sciences and technology
Information technology
Informed search
Optical communication
Optical computing
Optical design
Optical fiber communications
Optical fiber networks
Optical telecommunications
Optical wavelength conversion
Resource management
Routing (telecommunications)
Running
Searching
shortest path routing
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Transmission and modulation (techniques and equipments)
wavelength conversion
Wavelength routing
wavelength-routed network
Wavelengths
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0733-8724
1558-2213
DOI:10.1109/JLT.2007.912530