Abstract
We present a model for an interactive continuous media server. Such server systems work in an online environment without knowing future requirements of the customers. We apply competitive analysis to study different scenarios of the design and control of a server and we give upper and lower bounds for the competitive ratio.
This work was partly supported by the EC ACTS project SICMA (Scalable Interactive Continuous Media Server — Design and Application), No. AC071, http://www.uni-paderborn.de/cs/sicma
Supported by DFG-Graduiertenkolleg “Parallele Rechnernetzwerke in der Produktionstechnik”, GRK 124/2-96.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Aggarwal, J. A. Garay, and A. Herzberg. Adaptive video on demand. In P. G. Spirakis, editor, Proceedings of the Third Annual European Symposium on Algorithms, LNCS 979, pages 538–553, Berlin-Heidelberg-New York, 1995. Springer-Verlag.
J. Błazewicz, W. Cellary, R. Słowiński, and J. Weglarz. Scheduling under Resource Constraints — Deterministic Models, volume 7 of Annals of Oaeration Research. J.C. Baltzer AG, Scientific Publishing Company, Basel, 1986.
C. Bouras, V. Kapoulas, G. E. Pantziou, and P. G. Spirakis. Competitive scheduling schemes for video on demand. Technical Report CTI-TR 96.5.12, Computer Technology Institute, Patras, Greece, 1996.
P. Brucker. Scheduling Algorithms. Springer-Verlag, Berlin-Heidelberg-New York, 1995.
A. Dan, D. M. Dias, R. Mukherjee, D. Sitaram, and R. Tewari. Buffering and caching in large-scale video servers. In Proceedings of COMPCON 1995, pages 217–224, 1995.
D. J. Gemmell, H. M. Vin, D. D. Kandur, P. V. Rangan, and L. Rowe. Multimedia storage servers: A tutorial. IEEE Computer, 28(5):40–49, May 1995.
R. M. Karp, U. V. Vazirani, and V. V. Vazirani. An optimal algorithm for online bipartite matching. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 352–358, 1990.
R. J. Lipton and A. Tomkins. Online interval scheduling. In Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 302–311, 1994.
J. Sgall. On-line scheduling — a survey. In A. Fiat and G. J. Woeginger, editors, Dagstuhl Seminar on On-Line Algorithms (June 24–28, 1996), to appear in LNCS in Summer 1997. Springer-Verlag, Berlin-Heidelberg-New York.
D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202–208, Feb. 1985.
G. J. Woeginger. On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science, 130(1):5–16, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Monien, B., Berenbrink, P., Lüling, R., Riedel, M. (1997). Online scheduling of continuous media streams. In: Freksa, C., Jantzen, M., Valk, R. (eds) Foundations of Computer Science. Lecture Notes in Computer Science, vol 1337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052100
Download citation
DOI: https://doi.org/10.1007/BFb0052100
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63746-2
Online ISBN: 978-3-540-69640-7
eBook Packages: Springer Book Archive