We present a polynomial-time greedy algorithm that assigns proper wavelengths to a set of requests of maximum load L per directed fiber link on a directed ...
[PDF] Optimal Wavelength Routing on Directed Fiber Trees - CiteSeerX
citeseerx.ist.psu.edu › document
In this section we present the algorithm used to complete the edge coloring of the graph associated to a phase of the greedy algorithm for wavelength routing.
We present a polynomial-time greedy algorithm that assigns proper wavelengths to a set of requests of maximum load L per directed fiber link on a directed ...
We address the issue of efficiently assigning wavelengths to communication requests in wavelength division multiplexing (WDM) optical networks.
Missing: Optimal | Show results with:Optimal
This work surveys recent advances on the path coloring problem in both undirected and bidirected trees and presents hardness results and lower bounds for ...
We address the issue of efficiently assigning wavelengths to communication requests in wavelength division multiplexing (WDM) optical networks.
Abstract. We address the issue of efficiently assigning wavelengths to communication requests in wavelength division multiplexing (WDM) op- tical networks.
Missing: Optimal | Show results with:Optimal
For trees, we give a polynomial time routing algorithm that satisfies requests of maximum load L/sub max/ per fiber link using no more than 15L/sub max//8 ...
Missing: Optimal | Show results with:Optimal
People also ask
What wavelength is used for fiber optic transmission?
What is routing and wavelength assignment problem in optical networks?
We present a polynomial-time greedy algorithm that assigns proper wavelengths to a set of requests of maximum load L per directed fiber link on a directed ...
Optimal Wavelength Routing on Directed Fiber Trees. Erlebach, T., Jansen, K., Kaklamanis, C., Mihail, M., & Persiano, P. Theor. Comput.