On-line routing in all-optical networks

DOI10.1016/S0304-3975(99)00025-0zbMath0933.68005OpenAlexW148398262MaRDI QIDQ1960517

Stefano Leonardi, Yair Bartal

Publication date: 12 January 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00025-0

zbMATH Keywords

competitive analysisonline algorithmsoptical networksrouting

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Mathematical problems of computer architecture (68M07)

Related Items (8)

Online packet-routing in grids with bounded buffers ⋮ Dynamic vs. oblivious routing in network design ⋮ A Refined Analysis of Online Path Coloring in Trees ⋮ On the approximability of robust network design ⋮ Survey on Oblivious Routing Strategies ⋮ The complexity of path coloring and call scheduling ⋮ Short length Menger's theorem and reliable optical routing ⋮ On-line routing in all-optical networks

Cites Work

• Efficient routing in all-optical networks
• The Linearity of First-Fit Coloring of Interval Graphs
• Constrained bipartite edge coloring with applications to wavelength routing
• On-line competitive algorithms for call admission in optical networks
• Efficient wavelength routing on directed fiber trees
• Optimal on-line coloring of circular arc graphs
• On-line load balancing with applications to machine scheduling and virtual circuit routing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On-line routing in all-optical networks