Paper
22 September 2000 Dynamic wavelength assignment algorithm for wavelength-routed all-optical networks
Andrei G. Stoica, Abhijit Sengupta
Author Affiliations +
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.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Andrei G. Stoica and Abhijit Sengupta "Dynamic wavelength assignment algorithm for wavelength-routed all-optical networks", Proc. SPIE 4233, OptiComm 2000: Optical Networking and Communications, (22 September 2000); https://doi.org/10.1117/12.401821
Lens.org Logo
CITATIONS
Cited by 13 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer simulations

Switching

Wavelength division multiplexing

Optical communications

Optical networks

Time metrology

Computer engineering

Back to Top