Abstract
In this paper we formulate the problem of Video on Demand (VOD) from a resource allocation perspective. In particular, we introduce the decision 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 distinctive batching property, which stands for the feasibility of several requests being served by one resource (channel). We investigate the problem in an on-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 the competitive ratio of deterministic on-line movie scheduling algorithms for a variety of scenarios (an algorithm is called competitive 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 of refusal by choice with delayed 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.
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch, Y. Azar and A. Fiat. Tight Competitive ALgorithms for On-Line Max Cover or How to Beat Murphy's Law. Personal communication.
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.
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.
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.
A. Bar-Noy, J. Garay and A. Herzberg. Sharing Video on Demand. Unpublished manuscript.
R.L. Graham. Bounds on multiprocessing anomalies. SIAM Journal of Applied Mathematics, 17:263–269, 1969.
J. A. Garay and I. S. Gopal. Call Preemption in Communication Networks. Proc. INFOCOM '92, 1043–1050, Florence, Italy, May 1992.
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.
Colin J. Horton. 110 channels without boundaries: why restrict options? Communications Engineering and Design, 19/1:29–30, January 1993.
Steven M. McCarthy. Integrating Telco Interoffice Fiber Transport with Coaxial Distribution. Proc. SPIE — Int. Soc. Opt. Eng., 1786:23–33, November 1993.
John Koegel and Andrzej Syta. Routing of multi-media connections in hybrid networks. Proc. SPIE — Int. Soc. Opt. Eng., 1786:2–10, November 1993.
Richard J. Lipton and Andrew Tomkins. Online Interval Scheduling. Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms, Arlington, VA, 302–311, January 1994.
Kenneth Metz. Next generation catv networks. Proc. SPIE — Int. Soc. Opt. Eng., 1786:184–189, November 1993.
Chris Sell. Video on demand internal trial. Proc. SPIE — Int. Soc. Opt. Eng., 1786:168–175, November 1993.
Daniel D. Sleator and Robert E. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 32:652–686, 1985.
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.
Author information
Authors and Affiliations
Editor information
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
DOI: https://doi.org/10.1007/3-540-60313-1_169
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60313-9
Online ISBN: 978-3-540-44913-3
eBook Packages: Springer Book Archive