Abstract
We propose a class of distributed, online wavelength-assignment algorithms for
optical networks that take reach constraints into account. Given a desired route,
the goal of the assignment algorithm is to find a low-cost sequence of unoccupied
wavelength channels along the route. The sequence must satisfy constraints that
involve the availability of wavelength converters, regenerators, and reach
limitations. The proposed class of algorithms use least-cost computations in
auxiliary graphs. The graph structure enforces the constraints, while costs may be
assigned to the graph to represent the cost of network resources. In particular,
graph weights can be chosen to perform load-balancing of regenerator and fiber
resources. Simulations of the algorithm in ring and mesh networks demonstrate the
effectiveness of the load-balancing approach.
© 2003 Optical Society of America
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