System architecture for a large scale video on demand service
Computer Networks and ISDN Systems - Driving applications for future networks
Call preemption in communication networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Randomized algorithms
Randomized competitive algorithms for admission control in general networks
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Randomized adaptive video on demand
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Disk load balancing for video-on-demand systems
Multimedia Systems
Online computation and competitive analysis
Online computation and competitive analysis
On analytic modeling of multimedia batching schemes
Performance Evaluation
Competitive non-preemptive call control
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Physical Storage Organizations for Time-Dependent Multimedia Data
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Threshold-Based Dynamic Replication in Large-Scale Video-on-Demand Systems
RIDE '98 Proceedings of the Workshop on Research Issues in Database Engineering
Determining the Proper Number and Price of Software Licenses
IEEE Transactions on Software Engineering
Performance Analysis of Adaptive Admission Control Algorithms for Bandwidth Brokers
Journal of Network and Systems Management
An efficient architecture for bandwidth Brokers in DiffServ networks
International Journal of Network Management
Design and analysis of online batching systems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Hi-index | 0.00 |
In this paper we investigate the online video on demand problem, namely having to accept or reject a request for a movie without knowing the future requests. We present online movie-scheduling schemes that implement the principles of refusal by choice and delayed notification. A novel way to schedule movies that exploits the knowledge of the distribution of the preference of requests for movies, is shown to have a competitive ratio that outperforms all the previously known schemes in practical situations. In fact, our scheduler has a competitive ratio bounded above by a constant, independent of the number of the users, channels, or movies, in the case that a large fraction of the requests tends to concentrate in a small number of movies. We extend our approach by presenting an "adaptive" randomized scheduler which initially is not aware of the movie popularities but it adapts to it, and achieves the same asymptotic competitive ratio.