Abstract
The routing and wavelength assignment problem arises from the investigation of optimal wavelength allocation in an optical network that employs Wavelength Division Multiplexing (WDM). Consider an optical network that is represented by a connected, simple graph G. An all-to-all routing R in G is a set of paths connecting all pairs of vertices of G. The undirected optical index of G is the minimum integer k to guarantee the existence of a mapping ϕ:R→{1,2,…,k}, such that ϕ(P)≠ϕ(P′) if P and P′ have common edge(s), over all possible routings R. A natural lower bound of the undirected optical index of G is the (undirected) edge-forwarding index, which is defined to be the minimum of the maximum edge-load over all possible all-to-all routings. In this paper, we first derive the exact value of the optical index of the complete m-ary trees, and then investigate the gap between undirected optical and edge-forwarding indices.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
