On-line routing in all-optical networks
From MaRDI portal
Publication:4571982
DOI10.1007/3-540-63165-8_207zbMath1401.90053MaRDI QIDQ4571982
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
90C35: Programming involving graphs or networks
90B18: Communication networks in operations research
68W27: Online algorithms; streaming algorithms
Related Items
Unnamed Item, Unnamed Item, Approximating call-scheduling makespan in all-optical networks, 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