Abstract
Routing and wavelength assignment (RWA) is an important issue in the design of routing protocols in an all-optical network. A solution for the RWA problem should determine the least possible number of wavelengths, also known as the chromatic number. In this letter, we introduce the concept of cutset congestion, and show that the congestion of the most congested cutset of a graph representing the network is a tight lower bound for the chromatic number in the RWA problem. In contrast to other existing techniques, our method can be applied to any network and any traffic pattern.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.