Share Email Print

Proceedings Paper

Dynamic wavelength assignment algorithm for wavelength-routed all-optical networks
Author(s): Andrei G. Stoica; Abhijit Sengupta
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Dynamic wavelength assignment has been known to provide significant improvement of wavelength utilization in a wavelength routed all-optical network. This paper considers the dynamic wavelength assignment problem and presents a distributed algorithm to solve it. The presented algorithm shows a significant improvement over existing schemes by reducing the blocking probability often by an order of magnitude. The algorithm is based on the assumption of the availability of adequate processing power at the routers and lightpaths are constructed dynamically when two end-nodes need to communicate. The effectiveness of the algorithm is compared to the schemes in terms of blocking probability and set-up time through simulations.

Paper Details

Date Published: 22 September 2000
PDF: 12 pages
Proc. SPIE 4233, OptiComm 2000: Optical Networking and Communications, (22 September 2000); doi: 10.1117/12.401821
Show Author Affiliations
Andrei G. Stoica, Univ. of South Carolina (United States)
Abhijit Sengupta, Univ. of South Carolina (United States)

Published in SPIE Proceedings Vol. 4233:
OptiComm 2000: Optical Networking and Communications
Imrich Chlamtac, Editor(s)

© SPIE. Terms of Use
Back to Top