Metropolitan area video-on-demand service using pyramid broadcasting
Multimedia Systems
Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
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)
Minimizing Bandwidth Requirements for On-Demand Data Delivery
IEEE Transactions on Knowledge and Data Engineering
User Behaviour Analysis of a Video-On-Demand Service with a Wide Variety of Subjects and Lengths
EUROMICRO '05 Proceedings of the 31st EUROMICRO Conference on Software Engineering and Advanced Applications
Channel allocation problem in VoD system using both batching and adaptive piggybacking
IEEE Transactions on Consumer Electronics
Performance model of interactive video-on-demand systems
IEEE Journal on Selected Areas in Communications
Video-on-Demand Networks: Design Approaches and Future Challenges
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Most previous researches on patching scheme mainly focused on efficient patch stream generation to minimize the required bandwidth by proposing the optimum patching window. Another typical aspect is that they assumed that all the streaming speed is playback speed without deeply analyzing the effects of streaming speed. However, higher streaming speed, especially higher multicast streaming speed, may give better results in some aspects. Therefore, in this study, we analyze the effects of multicast streaming speed in the aspect of bandwidth usage, when VCR function is supported. First, we reanalyze the previous optimum patching window and total required bandwidth of the patching scheme, since the previous result is too approximate and give inaccurate results in some cases. So, we propose a modified optimum patching window to generate more accurate results when the speed of multicast streams is playback speed. Second, we calculate the optimum patching window and required bandwidth when the multicast streaming speed is multiple times the playback speed. The result shows that optimum patching window size reduces and required bandwidth increases when the speed of multicast stream increases. Finally, we show that the performance patching scheme degrades when VCR action is generated. The playback speed streaming of multicast streams gives good performance in bandwidth usage if VCR function is not considered. However, our analysis shows that the required bandwidth sharply increases when we consider VCR function support. The streaming speed of the multicast stream, which is equal to Fast Search (FS) streaming speed, gives the upper bound for the required bandwidth when FS function is considered.