Scheduling video programs in near video-on-demand systems
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
Multicast Video-on-Demand services
ACM SIGCOMM Computer Communication Review
Modeling and Dimensioning Hierarchical Storage Systems for Low-Delay Video Services
IEEE Transactions on Computers
On-Line Advancement of Transmission Plans in Video-on-Demand
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Convergence of periodic broadcasting and video-on-demand
Computer Communications
An effective batching scheme utilizing the segment interval time for wireless IPTV
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Heuristic batching policies for video-on-demand services
Computer Communications
| Hi-index | 0.03 |
In typical video delivery systems offering programs on-demand, service should be be nearly immediate and continuous. A video server can provide this type of service by reserving sufficient network and server resources for the duration of playout. Scalability and reduced cost can be achieved using a single channel to serve multiple customers waiting for the same program (referred to as batching). Batching is especially useful during high load periods typically occuring during evening prime time hours. Typical channel allocation algorithms use a greedy, allocate-as-needed policy. Variations in system load can cause these algorithms to suffer poor and unpredictable short-term performance, and non-optimal long term performance. In this paper, we develop a set of realistic workloads, identify the limitations of greedy allocation algorithms, and propose a set of rate-based allocation schemes to solve these limitations. The performance of various video delivery systems are simulated and compared. The rate-based policies are shown to be robust for the workloads examined, and are easy to implement.