Single-channel data broadcasting under small waiting latency

Due to the advancement of network technology,video-on-demand (vod) services are growing in popularity. however,individual stream allocation for client requests easily causes a vod system overload; when its network and disk bandwidth cannot match client growth. this study thus presents a fundamentally different approach by focusing solely on a class of applications identified as latency tolerant applications. because video broadcasting does not provide interactive (i.e.,vcr) functions,a client is able to tolerate playback latency from a video server. one efficient broadcasting method is periodic broadcasting,which divides a video into smaller segments and broadcasts these segments periodically on multiple channels. however,numerous practical systems,such as digital video broadcasting-handheld (dvb-h),do not allow clients to download video data from multiple channels because clients usually only have one tuner. to resolve this problem in multiple-channel broadcasting,this study proposes a novel single-channel broadcasting scheme,which leverages segment-broadcasting capability further for more efficient video delivery. the comparison results show that,with the same settings of broadcasting bandwidth,the proposed scheme outperforms the alternative broadcasting scheme,the hopping insertion scheme,singbroad,pas,and the reverse-order scheduling scheme for the maximal waiting time. © 2013 hsiang-fu yu.