Online scheduling of continuous media streams
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.
Unable to display preview. Download preview PDF.
- 1.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.Google Scholar
- 2.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.Google Scholar
- 3.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.Google Scholar
- 4.P. Brucker. Scheduling Algorithms. Springer-Verlag, Berlin-Heidelberg-New York, 1995.Google Scholar
- 5.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.Google Scholar
- 6.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.Google Scholar
- 7.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.Google Scholar
- 8.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.Google Scholar
- 9.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.Google Scholar