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

Theoretical Computer Science

Volumn 287, Issue 2, 2002, Pages 429-448

  Becchetti, Luca ^a   Di Ianni, Miriam ^b   Marchetti Spaccamela, Alberto ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; ROUTERS; SCHEDULING;

CALL SCHEDULING;

FIBER OPTIC NETWORKS;

EID: 0037190372     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00255-9     Document Type: Conference Paper

References (23)

1. Improved bounds for all optical routing
2. On-line competitive algorithms for call admission in optical networks
3. Lower bounds for on-line graph problems with application to on-line circuit and optical-routing
4. Efficient collective communication in optical networks
5. Dense wavelength division multiplexing networks: Principles and applications
6. Scheduling virtual connections in fast networks
7. Call scheduling in trees, rings and meshes
8. Optimal wavelength routing on directed fiber tree
9. Approximation algorithms for dynamic storage allocation
10. Algorithms for compile-time memory optimization
11. Bounds for multiprocessing timing anomalies
12. A polynomial time approximation scheme for the SONET ring loading problem
13. An extremal problem in recursive combinatorics
14. Packet routing and jobshop scheduling in O(congestion+dilation) steps
15. Dense wavelength division multiplexing networks: Principles and applications
16. Efficient routing in all-optical networks
17. The ring loading problem
18. Ring routing and wavelength translation