Open Access
2013 Single-Channel Data Broadcasting under Small Waiting Latency
Hsiang-Fu Yu
J. Appl. Math. 2013(SI15): 1-8 (2013). DOI: 10.1155/2013/629350

Abstract

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.

Citation

Download Citation

Hsiang-Fu Yu. "Single-Channel Data Broadcasting under Small Waiting Latency." J. Appl. Math. 2013 (SI15) 1 - 8, 2013. https://doi.org/10.1155/2013/629350

Information

Published: 2013
First available in Project Euclid: 14 March 2014

MathSciNet: MR3045402
Digital Object Identifier: 10.1155/2013/629350

Rights: Copyright © 2013 Hindawi

Vol.2013 • No. SI15 • 2013
Back to Top