Movatterモバイル変換

[0]ホーム
URL:

Skip to main content

Advertisement

Springer Nature Link
Log in

Adaptive Video on Demand

  • Session 9. Chair: Jan van Leeuwen
  • Conference paper
  • First Online:

Part of the book series:Lecture Notes in Computer Science ((LNCS,volume 979))

Included in the following conference series:

Abstract

In this paper we formulate the problem of Video on Demand (VOD) from a resource allocation perspective. In particular, we introduce thedecision element into a movie vending environment, which complements the current approaches. In contrast with more the traditional resource allocation problems (such as machine scheduling and call control), the problem possesses the distinctivebatching property, which stands for the feasibility of several requests being served by one resource (channel). We investigate the problem in anon-line fashion, namely, having to accept or reject a request for a movie without the knowledge of future requests. We show upper and lower bounds on thecompetitive ratio of deterministic on-line movie scheduling algorithms for a variety of scenarios (an algorithm is calledcompetitive if it performs, up to a constant factor, as well as its off-line, clairvoyant counterparts for the same problem). In particular, for the natural case ofrefusal by choice withdelayed notification, we present a class of algorithms that exhibit, under certain conditions, an asymptotically optimal behavior.

We also compare the performances of the different algorithms under various distributions of requests over time, and evaluate the effect of various heuristics.

This is a preview of subscription content,log in via an institution to check access.

Access this chapter

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. B. Awerbuch, Y. Azar and A. Fiat. Tight Competitive ALgorithms for On-Line Max Cover or How to Beat Murphy's Law. Personal communication.

    Google Scholar 

  2. B. Awerbuch, Y. Azar and S. Plotkin. Throughput-Competitive On-Line Routing.Proc. 34th Annual IEEE Symp. on Found. of Computer Science, 32–40, 1993.

    Google Scholar 

  3. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin and O. Waarts. On-Line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing.Proc. 25th Annual ACM Symp. on Theory of Computing, 623–631, 1993.

    Google Scholar 

  4. B. Awerbuch, Y. Bartal, A. Fiat and A. Rosen. Competitive Non-Preemptive Call Control.Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, 312–320, Arlington, VA, January 1993.

    Google Scholar 

  5. A. Bar-Noy, J. Garay and A. Herzberg. Sharing Video on Demand. Unpublished manuscript.

    Google Scholar 

  6. R.L. Graham. Bounds on multiprocessing anomalies.SIAM Journal of Applied Mathematics, 17:263–269, 1969.

    Google Scholar 

  7. J. A. Garay and I. S. Gopal. Call Preemption in Communication Networks.Proc. INFOCOM '92, 1043–1050, Florence, Italy, May 1992.

    Google Scholar 

  8. J.A. Garay, I. Gopal, S. Kutten, Y. Mansour and M. Yung. Efficient On-line Call Control Algorithms.Proc. 2nd Israeli Symp. on Theory of Computing and Systems, Netania, Israel, 285–293, June 1993.

    Google Scholar 

  9. Colin J. Horton. 110 channels without boundaries: why restrict options?Communications Engineering and Design, 19/1:29–30, January 1993.

    Google Scholar 

  10. Steven M. McCarthy. Integrating Telco Interoffice Fiber Transport with Coaxial Distribution.Proc. SPIE — Int. Soc. Opt. Eng., 1786:23–33, November 1993.

    Google Scholar 

  11. John Koegel and Andrzej Syta. Routing of multi-media connections in hybrid networks.Proc. SPIE — Int. Soc. Opt. Eng., 1786:2–10, November 1993.

    Google Scholar 

  12. Richard J. Lipton and Andrew Tomkins. Online Interval Scheduling.Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, Arlington, VA, 302–311, January 1994.

    Google Scholar 

  13. Kenneth Metz. Next generation catv networks.Proc. SPIE — Int. Soc. Opt. Eng., 1786:184–189, November 1993.

    Google Scholar 

  14. Chris Sell. Video on demand internal trial.Proc. SPIE — Int. Soc. Opt. Eng., 1786:168–175, November 1993.

    Google Scholar 

  15. Daniel D. Sleator and Robert E. Tarjan. Amortized efficiency of list update and paging rules.Communications of the ACM, 32:652–686, 1985.

    Google Scholar 

  16. D. Shmoys and J. Wein and D. Williamson. Scheduling Parallel Machines On-line.Proc. 32nd IEEE Symp. on Foundtations of Computer Science, 131–140, October 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lab. for Computer Science, MIT, 545 Technology Square, 02139, Cambridge, MA

    Sudhanshu Aggarwal

  2. IBM T. J. Watson Research Center, P.O. Box 704, 10598, Yorktown Heights, NY

    Juan A. Garay & Amir Herzberg

Authors
  1. Sudhanshu Aggarwal

    You can also search for this author inPubMed Google Scholar

  2. Juan A. Garay

    You can also search for this author inPubMed Google Scholar

  3. Amir Herzberg

    You can also search for this author inPubMed Google Scholar

Editor information

Paul Spirakis

Rights and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aggarwal, S., Garay, J.A., Herzberg, A. (1995). Adaptive Video on Demand. In: Spirakis, P. (eds) Algorithms — ESA '95. ESA 1995. Lecture Notes in Computer Science, vol 979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_169

Download citation

Publish with us

[8]ページ先頭
©2009-2025 Movatter.jp