Metropolitan area video-on-demand service using pyramid broadcasting
Multimedia Systems
Harmonic broadcasting is optimal
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Scheduling techniques for media-on-demand
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the Design of Efficient Video-on-Demand Broadcast Schedules
MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
A Low Bandwidth Broadcasting Protocol for Video on Demand
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Windows scheduling of arbitrary length jobs on parallel machines
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the 2nd ACM international workshop on Wireless multimedia networking and performance modeling
Generalized Fibonacci broadcasting an efficient VOD scheme with user bandwidth limit
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Lower bounds on average-case delay for video-on-demand broadcast protocols
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Design and analysis of online batching systems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Windows scheduling of arbitrary-length jobs on multiple machines
Journal of Scheduling
| Hi-index | 0.00 |
We establish tight bounds on the intrinsic cost (either minimizing delay d for fixed server and receiver bandwidths, or minimizing server bandwidth for fixed delay and receiver bandwidth) of broadcasting a movie of length m over a channel of bandwidth S in such a way that a receiver (with bandwidth R), starting at an arbitrary time t, can download the movie so that it can begin playback after a delay of at most d time units.Our bounds are realized by a simple abstract protocol that partitions the movie into a fixed number of segments, partitions the server bandwidth into an equivalent number of equal bandwidth subchannels, and broadcasts each segment repeatedly on its flown subchannel. This protocol can be implemented as a concrete discrete protocol in which movie information is packaged into discrete fixed length packets using only a modest overhead (measured in terms of increased delay or server bandwidth).Our primary contribution is a lower bound on the required delay that applies in a very general model of communication. This lower bound matches the behaviour of our abstract protocol in the limit as the number of segments approaches infinity. We are also able to relate its behaviour to arbitrary protocols that have a fixed number of segments.