Approximation algorithms for routing and call scheduling in all-optical chains and rings.

DOI10.1016/S0304-3975(01)00255-9zbMath1061.68183OpenAlexW2095359488MaRDI QIDQ1853488

Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00255-9

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (2)

Online mixed ring covering problem with two nodes ⋮ Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Efficient collective communciation in optical networks
• Optimal wavelength routing on directed fiber trees
• Efficient routing in all-optical networks
• Radius two trees specify χ‐bounded classes
• The Ring Loading Problem
• Approximation algorithms for dynamic storage allocation
• On-line competitive algorithms for call admission in optical networks
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Approximation algorithms for routing and call scheduling in all-optical chains and rings.