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
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription