Amortized efficiency of list update and paging rules
Communications of the ACM
Scheduling jobs with fixed start and end times
Discrete Applied Mathematics
Scheduling parallel machines on-line
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
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)
Optimal k-colouring and k-nesting of intervals
ISTCS'92 Symposium proceedings on Theory of computing and systems
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomized adaptive video on demand
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The Influence of Lookahead in Competitive Paging Algorithms (Extended Abstract)
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
A unified analysis of paging and caching
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Video on demand over ATM: constant-rate transmission and transport
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
Theoretical Computer Science
A hybrid priority-based video-on-demand resource sharing scheme
Computer Communications
Design and analysis of online batching systems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Hi-index | 0.00 |
We formulate the problem of video on demand (VOD) from a resource allocation perspective. We introduce the decision element into a movie vending environment, which complements the current approaches. In contrast with the traditional resource allocation problems (e.g., machine scheduling), the problem possesses the distinctive batching property, which stands for the feasibility of several requests being served by one resource.First, we investigate the problem in an on-line fashion, namely, having to accept or reject a request for a movie without any knowledge about future requests. We show upper and lower bounds on the competitive ratio of on-line movie scheduling algorithms for a variety of scenarios depending on the notification time. In particular, when the length of the movie and the notification time on requests are linearly related, we present a simple competitive algorithm.Second, we propose a new approach--Shared VOD--which gives a more balanced functionality/ price tradeoff than the two popular approaches full VOD and near VOD. In this approach, several users may share the same channels, but the movies are selected by the users themselves.In this framework, we evaluate a variety of on-line channel allocation algorithms under "typical" conditions. We compare these strategies to the off-line strategy, and show that the algorithm we introduce substantially outperforms the rest.