Efficient wavelength routing on directed fiber trees

DOI10.1007/3-540-61680-2_75zbMath1379.68014OpenAlexW1482143626MaRDI QIDQ4595507

Christos Kaklamanis, Pino Persiano

Publication date: 5 December 2017

Published in: Algorithms — ESA '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61680-2_75

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items (13)

Coloring all directed paths in a symmetric tree, with an application to optical networks ⋮ Constrained bipartite edge coloring with applications to wavelength routing ⋮ Colouring paths in directed symmetric trees with applications to WDM routing ⋮ A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree ⋮ A Refined Analysis of Online Path Coloring in Trees ⋮ On-line routing in all-optical networks ⋮ Optimal wavelength routing on directed fiber trees ⋮ The complexity of path coloring and call scheduling ⋮ Edge coloring of bipartite graphs with constraints ⋮ Sparse and limited wavelength conversion in all-optical tree networks ⋮ Efficient collective communciation in optical networks ⋮ On-line routing in all-optical networks ⋮ Randomized path coloring on binary trees.

This page was built for publication: Efficient wavelength routing on directed fiber trees