Off-line and on-line call-scheduling in stars and trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1335, Issue , 1997, Pages 199-213

  Erlebach, Thomas ^a   Jansen, Klaus ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; FORESTRY; GRAPH THEORY; STARS;

BANDWIDTH REQUIREMENT; COMPETITIVE RATIO; LOWER AND UPPER BOUNDS; MINIMUM MAKESPAN; ON-LINE ALGORITHMS; PERFORMANCE RATIO; SCHEDULING PROBLEM; WORST-CASE PERFORMANCE;

SCHEDULING;

EID: 84949673107     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0024499     Document Type: Conference Paper

References (16)

1. Y. Aumann and Y. Rabani. Improved bounds for all optical routing. In Proceedings of the 6th Annual A CM-SfAM Symposium on Discrete Algorithms SODA '95, pages 567-576, 1995.
2. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rosén. Competitive non-preemptive call control. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '94, pages 312-320, 1994.
3. Y. Bartal and S. Leonardi. On-line routing in all-optical networks. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming [CALP '97, LNCS 1256, pages 516-526. Springer-Verlag, 1997.
4. E. Coffman Jr., M. Garey, D. Johnson, and A. Lapaugh. Scheduling file transfers. SIAM J. Comput., 14(3):744-780, August 1985.
5. T. Erlebach and K. Jansen. Scheduling of virtual connections in fast networks. In Proceedings of the 4th Parallel Systems and Algorithms Workshop PASA '96, pages 13-32. World Scientific Publishing, 1997.
6. T. Erlebach and K. Jansen. Call scheduling in trees, rings and meshes. In Proceedings of the 30th Hawaii International Conference on System Sciences HICSS-30, volume 1, pages 221-222. IEEE Computer Society Press, 1997.
7. A. Feldmann, B. Maggs, J. Sgall, D. D. Sleator, and A. Tomkins. Competitive analysis of call admission algorithms that allow delay. Technical Report CMU-CS- 95-102, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, January 1995.
8. A. Feldmann. On-line call admission for high-speed networks (Ph.D. Thesis). Technical Report CMU-CS-95-201, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, October 1995.
9. R. Graham. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math., 17(2):416-429, March 1969.
10. R. Graham. Bounds on the performance of scheduling algorithms. In E. G. Coffman, Jr., editor, Computer and Job-Shop Scheduling Theory, pages 165-227. John Wiley & Sons, Inc., New York, 1976.
11. J. Hoogeveen, S. van de Velde, and B. Veltman. Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Appl. Math., 55:259-272, 1994.
12. C. Kaklamanis, P. Persiano, T. Erlebach, and K. Jansen. Constrained bipartite edge coloring with applications to wavelength routing. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming ICALP ‘97, LNCS 1256, pages 493-504. Springer-Verlag, 1997.
13. T. Nishizeki and K. Kashiwagi. On the 1.1 edge-coloring of multigraphs. SIAM J. Disc. Math., 3(3):391-410, August 1990.
14. D. B. Shmoys, J. Wein, and D P Williamson. Scheduling parallel machines online. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science FOCS '91, pages 131-140, 1991.
15. The ATM Forum, Upper Saddle River, NJ. ATM User-Network Interface (UNI) Specification Version 3.1., 1995.
16. J. van Leeuwen, editor. Handbook of Theoretical Computer Science. Volume A: Algorithms and complexity. Elsevier North-Holland, Amsterdam, 1990.