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
Optimal and efficient merging schedules for video-on-demand servers
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
A Proposal of Multicast for Personalized Media Stream Delivery
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part I
Asynchronous Media Casting Network: An Optimal Network Scheme for On-Demand Video Distribution
AINA '03 Proceedings of the 17th International Conference on Advanced Information Networking and Applications
Techniques for Improving the Capacity of Video-on-Demand Systems
HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 2: Decision Support and Knowledge-Based Systems
Video-on-Demand Server Efficiency through Stream Tapping
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
Supplying Instantaneous Video-on-Demand Services Using Controlled Multicast
ICMCS '99 Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02
Research in mobile database query optimization and processing
Mobile Information Systems
| Hi-index | 0.00 |
This paper introduces fragmented patching, a new video on-demand technique that enables mobile clients to receive a video stream while moving freely. Patching techniques that significantly reduce the required network bandwidth through multicasting have shown potential for on-demand video distribution. However, patch-flow techniques based on unicast data are unsuitable for providing services to mobile clients because an intricate form of mobile routing is needed for each unicast flow to enable it to individually follow a moving client. Conversely, in fragmented patching, patch flows are sent via broadcasting. The patch flows are divided into segments to avoid increasing traffic due to broadcasting; each of the segments is aggregated to be shared with as many clients as possible. In addition, we have considered broadcasting shared flows also to eliminate any overhead arising from multicast tree construction. This paper analyzes the network bandwidth required for fragmented patching for two cases: when the patch flow is broadcast and the shared flow is multicast, and when both the patch and shared flows are broadcast. Numerical analysis based on the traffic intensity (Erlang) has revealed that the aggregation effect caused by segmenting patch flows counteracts the increase in traffic caused by broadcasting. It also showed that fragmented patching reduces the required bandwidth by a greater extent than other patching techniques even when both the patch and shared flows are broadcast.