Dynamic batching policies for an on-demand video server
Multimedia Systems
Metropolitan area video-on-demand service using pyramid broadcasting
Multimedia Systems
Video-on-demand broadcasting protocols
Multimedia communications
Nearly optimal perfectly-periodic schedules
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Harmonic broadcasting is optimal
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Windows scheduling problems for broadcast systems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A Low Bandwidth Broadcasting Protocol for Video on Demand
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Exploiting Client Bandwidth for More Efficient Video Broadcast
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Windows scheduling as a restricted version of Bin Packing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Windows scheduling of arbitrary length jobs on parallel machines
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ
ACM Transactions on Algorithms (TALG)
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
Windows scheduling as a restricted version of bin packing
ACM Transactions on Algorithms (TALG)
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
Optimal delay for media-on-demand with pre-loading and pre-buffering
Theoretical Computer Science
A general buffer scheme for the windows scheduling problem
Journal of Experimental Algorithmics (JEA)
Optimal delay for media-on-demand with pre-loading and pre-buffering
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
An optimization problem related to vod broadcasting
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
A general buffer scheme for the windows scheduling problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Harmonic block windows scheduling through harmonic windows scheduling
MIS'05 Proceedings of the 11th international conference on Advances in Multimedia Information Systems
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 |
Broadcasting popular media to clients is the ultimate scalable solution for media-on-demand. Recently, it was shown that if clients can receive data at a rate faster than what they need for playback and if they can store later parts of the media in their buffers, then much higher scalability may be obtained. In the paper we focus on scheduling problems arising from these new systems for media-on-demand.For given amount of bandwidth, we improve the guaranteed start-up delay time for an uninterrupted playback. We achieve our results by introducing two techniques. In the first, the media is arranged on the channels such that clients gain from buffering later parts of the transmission before the actual start of the playback. In the second, segments of different media may be mixed together on the same channel. We introduce a simple class of recursive round-robin scheduling algorithms that implement our techniques.Our results improve the best known asymptotic results. Moreover, our scheduling algorithms outperform known results for "practical" values for number of media and number of broadcasting channels. For some specific small values, we present hand designed solutions that are better than those achieved by our algorithms.