On-line routing in all-optical networks

DOI10.1007/3-540-63165-8_207zbMath1401.90053OpenAlexW1510288372MaRDI QIDQ4571982

Stefano Leonardi, Yair Bartal

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_207

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Approximating call-scheduling makespan in all-optical networks ⋮ Unnamed Item ⋮ Sparse Semi-Oblivious Routing: Few Random Paths Suffice ⋮ Unnamed Item ⋮ Nash equilibria in all-optical networks

Cites Work

• On-line routing in all-optical networks
• Efficient routing in all-optical networks
• Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing
• 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

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