Abstract

In all-optical networks that use wavelength division multiplexing (WDM) technique, a challenging problem called the routing and wavelength assignment problem (RWA) is modelled as that connection requests must be assigned paths and wavelengths such that intersecting paths receive different wavelengths, and the goal is to minimize the number of wavelengths used. Besides the tree, another popular network topology is the tree of rings which is obtained by interconnecting rings in a tree structure such that any two rings share at most one node. A polynomial-time optimal algorithm and an approximation algorithm are given for the RWA problem in bounded-degree tree and tree of rings networks, respectively.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.