Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
All-optical networks with sparse wavelength conversion
IEEE/ACM Transactions on Networking (TON)
Some principles for designing a wide-area WDM optical network
IEEE/ACM Transactions on Networking (TON)
Adaptive wavelength routing in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in optical networks
IEEE/ACM Transactions on Networking (TON)
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
IEEE/ACM Transactions on Networking (TON)
Computing approximate blocking probabilities for a class of all-optical networks
IEEE Journal on Selected Areas in Communications
Models of blocking probability in all-optical networks with and without wavelength changers
IEEE Journal on Selected Areas in Communications
Design of the optical path layer in multiwavelength cross-connected networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In wavelength division multiplexing (WDM) optical networks, a fundamental problem is routing and wavelength assignment (RWA) for lightpath requests from client. Depending on whether lightpath requests randomly arrive/depart or are given in advance, this problem is classified as dynamic or static RWA. In the former case, each node periodically broadcasts the wavelengths status of its incident links to the network, so that each individual node can perform RWA in a distributed mode. However, due to the potential large number of wavelengths and fiber links, frequent broadcasting of wavelength status results in large overhead and poor scalability. One solution for this problem is to summarize the wavelength status information and then broadcast the summarized information, which significantly decreases the amount of broadcast information. Nevertheless, existing dynamic RWA algorithms require full wavelength status information. To addresses RWA using summarized information, this paper proposes an effective algorithm, which can achieve a performance close to the one using full wavelength status information, while dramatically reducing the overhead of wavelength status broadcasting and processing.