Handbook of theoretical computer science (vol. A): algorithms and complexity
Handbook of theoretical computer science (vol. A): algorithms and complexity
Efficient routing in all-optical networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Scheduling Parallel Machines On-line
SIAM Journal on Computing
Approximations for the disjoint paths problem in high-diameter planar networks
STOC '95 Proceedings of the twenty-seventh 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
Theoretical Computer Science - Special issue on parallel computing
Optimal wavelength routing on directed fiber trees
Theoretical Computer Science
Improved bounds for all optical routing
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On-Line Routing in All-Optical Networks
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Approximation Algorithms for Routing and Call Scheduling in All-Optical Chains and Rings
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Off-Line and On-Line Call-Scheduling in Stars and Trees
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Fast algorithms for finding O(congestion+dilation) packet routing schedules
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
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
Request scheduling on WDM networks with tunable ADMs
ACOS'06 Proceedings of the 5th WSEAS international conference on Applied computer science
| Hi-index | 0.00 |
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 route from source to destination, 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 study the relationship between this problem and minimum path coloring and we show how to exploit known results on path coloring to derive approximation scheduling algorithms for meshes, trees and nearly-Eulerian, uniformly high-diameter graphs. Independently from the relationship with path coloring we propose different approximation algorithms for call scheduling in trees and in trees of rings. As a side result, we present a constant approximation algorithm for star networks. We assume for simplicity that all calls are released at time 0, however all our results hold also for arbitrary release dates at the expense of a factor 2 in the approximation ratio.