Dynamic batching policies for an on-demand video server
Multimedia Systems
Patching: a multicast technique for true video-on-demand services
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
A prefetching scheme based on the analysis of user access patterns in news-on-demand system
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Optimal and efficient merging schedules for video-on-demand servers
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Minimizing Bandwidth Requirements for On-Demand Data Delivery
IEEE Transactions on Knowledge and Data Engineering
Adaptive segment-based patching scheme for video streaming delivery system
Computer Communications
Pull-patching: a combination of multicast and adaptive segmented HTTP streaming
Proceedings of the international conference on Multimedia
Hi-index | 0.24 |
In adaptive segment-based patching scheme, the video is divided into fixed number of segments, which are transmitted over the server channels. For efficient transmission of the video segments, the server channels are classified into two types - regular and patching channels. A regular channel generally transmits fixed number of segments and a patching channel helps transmitting those segments that cannot be provided by any regular channel to the users. The number of segments transmitted by the first regular channel is decided by the number of regular channels that are allocated to the video by the video server. Other regular channels transmit pre-specified number of segments. This scheme estimates the bandwidth of the patching channels based on the requests received at the video server in terms of fixed time intervals, called time slots. The bandwidth estimation in this scheme is less accurate because for multiple requests received in a time slot more than one patching channels are used. Second, the probability distribution considered in this scheme does not satisfy the basic rule, i.e., the sum of all probabilities is not 1. In this paper, we address these issues and propose a new protocol named as Segmented Patching Broadcasting Protocol for Video Data. The average server bandwidth allocated to the patching channels is much less as compared to the adaptive segment-based patching scheme because only one patching channel is sufficient for any number of requests received in a time slot.