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

Authors:
Luca Becchetti;Miriam Di Ianni;Alberto Marchetti-Spaccamela
Affiliations:
Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", Via Salaria 113, 00198 Roma, Italy;Dipartimento di Ingegneria Elettronica e dell'Informazione, Università di Perugia, Perugia, Italy;Dipartimento di Informatica e Sistemistica, Università di Roma "La Sapienza", Via Salaria 113, 00198 Roma, Italy
Venue:
Theoretical Computer Science
Year:
2002

Citing 12
Cited 2

Efficient routing in all-optical networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for on-line graph problems with application to on-line circuit and optical routing

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On-line call admission for high-speed networks

On-line call admission for high-speed networks
The Ring Loading Problem

SIAM Journal on Discrete Mathematics
Optimal wavelength routing on directed fiber trees

Theoretical Computer Science
Ring routing and wavelength translation

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for compile-time memory optimization

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient collective communication in optical networks

Theoretical Computer Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximation Algorithms for Dynamic Storage Allocations

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
On-line Competive Algorithms for Call Admission in Optical Networks

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Call Scheduling in Trees, Rings and Meshes

HICSS '97 Proceedings of the 30th Hawaii International Conference on System Sciences: Software Technology and Architecture - Volume 1

Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem

Journal of Discrete Algorithms
Request scheduling on WDM networks with tunable ADMs

ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study the problem of routing and scheduling requests of limited durations in an all-optical network. The task is servicing the requests, assigning each of them a starting time and a wavelength, with restrictions on the number of available wavelengths. The goal is minimizing the overall time needed to serve all requests. We propose constant approximation algorithms for both ring and chain networks. In doing this, we also propose a polynomial-time approximation scheme for the problem of routing weighted calls on a directed ring with minimum load.