Dynamic batching policies for an on-demand video server
Multimedia Systems
Scheduling Video Streams in Video-on-Demand Systems: A Survey
Multimedia Tools and Applications
Efficient schemes for broadcasting popular videos
Multimedia Systems
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
An efficient scheme for broadcasting popular videos at low buffer demand
Computer Communications
An enhanced recursive frequency splitting broadcasting algorithm for near video-on-demand services
Information Processing Letters
Smooth workload adaptive broadcast
IEEE Transactions on Multimedia
Staircase data broadcasting and receiving scheme for hot video service
IEEE Transactions on Consumer Electronics
Hi-index | 0.00 |
This work presents a novel interleaving crescent broadcasting protocol for near video-on-demand service. The interleaving crescent broadcasting protocol is a trade-off among the subscriber's access latency, maximum buffer requirement, needed subscriber's bandwidth, and maximum disk I/O transfer rate. A longer subscriber's access latency may cause a subscriber to leave. A lower maximum buffer requirement, a lower needed subscriber's bandwidth, and a lower maximum disk I/O transfer rate reduce subscribers' costs. The interleaving crescent broadcasting protocol not only makes access latency shorter, but also lowers the overall system's cost. We prove the correctness of the interleaving crescent protocol; provide mathematical analyses to demonstrate its efficiency.