IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Algorithms: design techniques and analysis
Algorithms: design techniques and analysis
A Study of Dynamic Routing and Wavelength Assignment with Imprecise Network State Information
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Routing and wavelength assignment in wavelength division multiplexing networks
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
An approach to wide area WDM optical network design using genetic algorithm
Computer Communications
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Photonic Network Communications
| Hi-index | 0.00 |
Wavelength Division Multiplexing (WDM) offers the capability to handle the increasing demand of network traffic in a manner that takes the advantage of already deployed optical fibers. A lightpath is an all optical communication path between end-to-end over a same wavelength used on each intermediate link. Wavelengths are the main resources in WDM optical networks. The wavelength assignment problem has been solved by mapping it to a heuristic based clique partitioning problem under the wavelength continuity constraint. For routing, Dijkstra's shortest-path algorithm is used. Here, we propose two new polynomial time heuristics for wavelength assignment called CPWA1 and CPWA2, based on clique partitioning concepts for static traffic demand with the objective of minimizing the number of wavelengths. The performance of our proposed algorithms are analyzed through extensive simulations on different set of traffic demands under a wide range of network topologies. The results show that proposed mechanism requires less number of wavelengths per fiber for a given set of traffic demand as compared to an existing well known algorithms.