Abstract
Given a communication network and a set of call requests, the goal is to find a minimum makespan schedule for the calls such that the sum of the bandwidth requirements of simultaneously active calls using the same link does not exceed the capacity of that link. In this paper the call-scheduling problem is studied for star and tree networks. Lower and upper bounds on the worst-case performance of List-Scheduling (LS) and variants of it are obtained for call-scheduling with arbitrary bandwidth requirements and either unit call durations or arbitrary call durations. LS does not require advance knowledge of call durations and, hence, is an on-line algorithm. It has performance ratio (competitive ratio) at most 5 in star networks. A variant of LS for calls with unit durations is shown to have performance ratio at most \(2\frac{2}{3}\). In tree networks with n nodes, a variant of LS for calls with unit durations has performance ratio at most 6, and a variant for calls with arbitrary durations has performance ratio at most 5 log n.
Partly supported by German Science Foundation (DFG), Contract: SFB 342 TP A7.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Y. Aumann and Y. Rabani. Improved bounds for all optical routing. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '95, pages 567–576, 1995.
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.
Y. Bartal and S. Leonardi. On-line routing in all-optical networks. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming ICALP '97, LNCS 1256, pages 516–526. Springer-Verlag, 1997.
E. Coffman, Jr., M. Garey, D. Johnson, and A. Lapaugh. Scheduling file transfers. SIAM J. Comput., 14(3):744–780, August 1985.
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.
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.
A. Feldmann, B. Maggs, J. So-all, D. D. Sleator, and A. Tomkins. Competitive analysis of call admission algorithms that allow delay. Technical Report CMU-CS95-102, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, January 1995.
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.
R. Graham. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math., 17(2):416–429, March 1969.
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.
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.
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.
T. Nishizeki and K. Kashiwagi. On the 1.1 edge-coloring of multigraphs. SIAM J. Disc. Math., 3(3):391–410, August 1990.
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 FOGS '91, pages 131–140, 1991.
The ATM Forum, Upper Saddle River, NJ. ATM User-Network Interface (UNI) Specification Version 3.1., 1995.
J. van Leeuwen, editor. Handbook of Theoretical Computer Science. Volume A: Algorithms and complexity. Elsevier North-Holland, Amsterdam, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erlebach, T., Jansen, K. (1997). Off-line and on-line call-scheduling in stars and trees. In: Möhring, R.H. (eds) Graph-Theoretic Concepts in Computer Science. WG 1997. Lecture Notes in Computer Science, vol 1335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024499
Download citation
DOI: https://doi.org/10.1007/BFb0024499
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63757-8
Online ISBN: 978-3-540-69643-8
eBook Packages: Springer Book Archive