Piecewise Patching for Time-shifted TV Over HFC Networks

In video-on-demand (VOD) systems, a number of sophisticated architectures have been proposed to provide instantaneous services through the use of multicast technology. Most of the architectures focus on minimizing bandwidth requirements under the assumption that clients play from beginning to end, but this assumption is not suitable for time-shifted TV. Moreover, they have been proposed on an IP network, and failed to make full use of the broadcasting property of hybrid fiber coaxial (HFC) network. In this paper, we propose a novel delivery scheme, named as piecewise patching (PP), to tackle these problems. The piecewise patching scheme provides the video data for the users in a piecewise mode instead of a whole patching stream which includes all missing data. The former user can utilize the data from the later users' patching stream whose playback time is in advance of the former user's patching stream. In the proposed scheme, each client receives the data simultaneously from arbitrary channels which broadcast the same content. Simulation results show that the proposed scheme improves the performance of time-shift TV service significantly in terms of total server bandwidth requirement.

[1]  Mary K. Vernon,et al.  Minimizing Bandwidth Requirements for On-Demand Data Delivery , 2001, IEEE Trans. Knowl. Data Eng..

[2]  John C. S. Lui,et al.  Adaptive piggybacking: a novel technique for data sharing in video-on-demand storage servers , 2009, Multimedia Systems.

[3]  Kien A. Hua,et al.  Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems , 1997, SIGCOMM '97.

[4]  Ying Cai,et al.  Optimizing patching performance , 1998, Electronic Imaging.

[5]  Mary K. Vernon,et al.  Optimal and efficient merging schedules for video-on-demand servers , 1999, MULTIMEDIA '99.

[6]  Hsiang-Fu Yu,et al.  Reverse Fast Broadcasting (RFB) for Video-on-Demand Applications , 2007, IEEE Transactions on Broadcasting.

[7]  Kien A. Hua,et al.  Virtual Batching: A New Scheduling Technique for Video-on-Demand Servers , 1997, DASFAA.

[8]  Philip S. Yu,et al.  On optimal batching policies for video-on-demand storage servers , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[9]  Tomasz Imielinski,et al.  Metropolitan area video-on-demand service using pyramid broadcasting , 1996, Multimedia Systems.

[10]  Donald F. Towsley,et al.  Supplying instantaneous video-on-demand services using controlled multicast , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[11]  Victor O. K. Li,et al.  Supporting Interactive Video-on-Demand With Adaptive Multicast Streaming , 2007, IEEE Transactions on Circuits and Systems for Video Technology.

[12]  S. Chand,et al.  Generalized conservative staircase data broadcasting protocol for video-on-demand , 2006, IEEE Transactions on Consumer Electronics.

[13]  Asit Dan,et al.  Scheduling policies for an on-demand video server with batching , 1994, MULTIMEDIA '94.

[14]  Songyu Yu,et al.  A new patching channel schedule scheme for video multicast , 2003, IEEE Trans. Consumer Electron..

[15]  Donald F. Towsley,et al.  Efficient schemes for broadcasting popular videos , 2002, Multimedia Systems.

[16]  Li-Ming Tseng,et al.  Fast data broadcasting and receiving scheme for popular video service , 1998, IEEE Trans. Broadcast..

[17]  Mary K. Vernon,et al.  Dynamic Skyscraper Broadcasts for Video-on-Demand , 1998, Multimedia Information Systems.