Scheduling policies for an on-demand video server with batching
MULTIMEDIA '94 Proceedings of the second ACM international conference on Multimedia
Patching: a multicast technique for true video-on-demand services
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
The Split and Merge Protocol for Interactive Video-on-Demand
IEEE MultiMedia
Supplying Instantaneous Video-on-Demand Services Using Controlled Multicast
ICMCS '99 Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2
An Adaptive Hybrid Technique for Video Multicast
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
On Optimal Batching Policies for Video-on-Demand Storage Servers
ICMCS '96 Proceedings of the 1996 International Conference on Multimedia Computing and Systems
Threshold-based multicast for continuous media delivery
IEEE Transactions on Multimedia
On a unified architecture for video-on-demand services
IEEE Transactions on Multimedia
Modified polyharmonic data broadcasting scheme for popular videos
IEEE Transactions on Consumer Electronics
Generalized conservative staircase data broadcasting protocol for video-on-demand
IEEE Transactions on Consumer Electronics
Request based data delivery in video-on-demand services
IEEE Transactions on Consumer Electronics
Multicast with cache (Mcache): an adaptive zero-delay video-on-demand service
IEEE Transactions on Circuits and Systems for Video Technology
Minimizing the worst-case playback delay in VoD services over passive optical networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
On guaranteed VoD services in next generation optical access networks
IEEE Journal on Selected Areas in Communications - Special issue on next-generation broadband optical access network technologies
Hi-index | 0.00 |
In the request-based scheme, a patching channel is initiated on arrival of a request in an interarrival time of two adjacent multicast channels. If two requests are received in a short duration in an interarrival time, two patching channels are needed to service them. Both these channels deliver almost the same data, thus, wasting the bandwidth. This problem may be addressed in two ways: using higher level patching technique, or forcing the first request to wait for the second one. Using higher level patching technique makes the system more complex and thus usually not preferred. In the second case, the bandwidth usage certainly reduces, but the length of the waiting time by the first request for the second request is the main issue. In this paper, this issue is addressed by dividing the video duration into uniform time slots such that there is at least one request in a time slot for initiating the patching channel. The proposed scheme is named as Video Data Delivery using Slotted Patching. In this scheme, the patching channels download much less video data than the request-based scheme and thus require less bandwidth. This scheme may not provide immediate services to all users unlike the request-based scheme, but the user's waiting can be made arbitrarily small without using much resources unlike the request-based scheme.