Abstract
Periodic broadcasting is a cost-effective solution for the large-scale distribution of popular videos. This strategy guarantees constant worst service latency to all clients, regardless of the number of video requests. The practical channel transition broadcasting (PCTB) scheme is an essential periodic broadcasting method that can dynamically add or release broadcasting channels (i.e., channel transition) according to video popularity. However, PCTB experiences bandwidth waste when performing channel transition. This study further finds that PCTB yields transition playback latency during channel addition. Therefore, an enhanced version referred to as PCTB+ is proposed to cause less bandwidth waste and lower transition playback latency. The applicability of this new scheme is verified, and an analytical evaluation is provided to demonstrate its performance advantage. The new scheme reduces bandwidth waste by 50 % to 100 % compared to the original PCTB scheme. Moreover, PCTB+ yields 50 % smaller transition playback latency than PCTB. The proposed scheme outperforms the seamless fast broadcasting (SFB) scheme for bandwidth waste under most conditions. No extra startup latency and client buffer demand are required when using PCTB+.
Similar content being viewed by others
References
Chand S, Om H (2010) Efficient staircase scheme with seamless channel transition mechanism. Comput Netw 54:462–474
Chen Y-W, Chen C-Y (2011) PAS: a new scheduling scheme for broadcasting a video over a single channel. IET Commun 5(7):951–960
Chen Y-W, Lin C-C, Huang C-Y (2012) Hybrid broadcasting scheme with low waiting time and buffer requirement for video-on-demand services. IET Commun 6(17):2949–2956
Chen Y-N, Tseng L-M (2012) An efficient periodic broadcasting with small latency and buffer demand for near video on demand. Int J Digital Multimedia Broadcast. Article ID 717538, 7
Chien W-D, Yeh Y-S, Wang J-S (2005) Practical channel transition for near-VOD services. IEEE Trans Broadcast 51(3):360–365
Choi J, Reaz A, Mukherjee B (2012) A survey of user behavior in VoD service and bandwidth-saving multicast streaming schemes. IEEE Commun Surv Tutor 14(1):156–169
De Vleeschauwer D (2009) Performance of caching algorithms for IPTV on-demand services. IEEE Trans Broadcast 55(2):491–501
Digital TV Research (2012) A sustained boom forecast for global online TV and video
Febiansyah H, Kwon JB (2012) Dynamic proxy-assisted scalable broadcasting of videos for heterogeneous environments. Multimedia Tools and Applications, available online
Guo Y, Gao L, Towsley D, Sen S (2004) Smooth workload adaptive broadcast. IEEE Trans Multimed 6(2):387–395
Hua KA, Sheu S (1997) Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on-demand systems. ACM SIGCOMM, pp. 89–100
Juhn L-S, Tseng L-M (1997) Staircase data broadcasting and receiving scheme for hot video service. IEEE Trans Consum Electron 43(4):1110–1117
Juhn L-S, Tseng L-M (1998) Fast data broadcasting and receiving scheme for popular video services. IEEE Trans Broadcast 44(1):100–105
Kwon JB (2011) Proxy-assisted scalable periodic broadcasting of videos for heterogeneous clients. Multimedia Tools Appl 51(3):1105–1125
Natarajan A, Cai Y, Wong J (2009) An enhanced client-centric approach for efficient video broadcast. Multimedia Tools Appl 43(2):179–193
Tang W, Fu Y, Cherkasova L, Vahdat A (2007) Modeling and generating realistic streaming media server workloads. Comput Netw 51(1):336–356
TechNavio (2012) Global video on demand market 2011–2015
Tseng Y-C, Chueh Y-C, Sheu J-P (2004) Seamless channel transition for the staircase video broadcasting scheme. IEEE/ACM Trans Netw 12(3):559–571
Tseng Y-C, Yang M-H, Chang C-H (2002) A recursive frequency-splitting scheme for broadcasting hot videos in VOD service. IEEE Trans Commun 50(8):1348–1355
Tseng Y-C, Yang M-H, Hsieh C-M, Liao W-H, Sheu J-P (2001) Data broadcasting and seamless channel transition for highly demanded videos. IEEE Trans Commun 49(5):863–874
Vilas M, Paneda XG, Garcia R, Melendi D, Garcia VG (2005) User behavior analysis of a video-on-demand service with a wide variety of subjects and lengths. In Proceedings of the 31st EUROMICRO Conference on Software Engineering and Advanced Applications, pp. 330–337
Wu C-J, Chen Y-W, Wang Y-L (2011) The minimum bandwidth required at each time slot of the fast broadcasting scheme. Inf Process Lett 111(20):1014–1018
Wu C-J, Chen Y-W, Yan J-H, Wang Y-L (2007) Seamless channel transition for slotted generalized fibonacci broadcasting. Multimedia Systems 13:223–233
Wu B-S, Hsieh C-C, Chen Y-W (2011) A reverse-order scheduling scheme for broadcasting continuous multimedia data over a single channel. IEEE Trans Broadcast 57(3):721–728
Yang Z-Y, Chen Y-M, Tseng L-M (2012) A seamless broadcasting scheme with live video support. Int J Digit Multimedia Broadcast. Article ID 373459, 8
Yu H-F (2008) Hybrid broadcasting with small buffer demand and waiting time for video-on-demand applications. IEEE Trans Broadcast 54(2):304–311
Yu H-F (2012) Improvement of the client-centric approach for broadcasting popular videos. Multimedia Tools and Applications, available on line
Yu H-F, Chen Y-N, Yang H-C, Yang Z-Y, Tseng L-M (2008) An efficient scheme for broadcasting popular videos at low buffer demand. Comput Commun 31(10):2270–2279
Yu H-F, Ho P-H, Yang H-C (2009) Generalized sequence-based and reverse sequence-based models for broadcasting hot videos. IEEE Trans Multimed 11(1):152–165
Yu H-F, Yang H-C, Tseng L-M (2007) Reverse fast broadcasting (RFB) for video-on-demand applications. IEEE Trans Broadcast 53(1):103–111
Yu H-F, Yang H-C, Wang Y-T, Fan P-L, Chien C-Y (2009) Broadcasting scheme with low client buffers and bandwidths for video-on-demand applications. Multimedia Tools Appl 42(3):295–316
Yu H, Zheng D, Zhao BY, Zheng W (2006) Understanding user behavior in large-scale video-on-demand systems. In Proceedings of EuroSys, pp. 333–344
Acknowledgments
This work was financially supported by National Science Council, Taiwan under a research grant numbered NSC 101-2221-E-152-004.
Author information
Authors and Affiliations
Corresponding author
Appendix A
Appendix A
Lemma 1.
If T S (C′1) ≤ T S (C′1) + xd′ ≤ T S (C′ k+m ) occurs, the client downloads at least one new segment in every time length d′ until T S (C′ k+m ) + 2k+m−1 d′.
Proof.
Step 1 of Segment Downloading indicates that the client sequentially downloads 2p−1 segments from each channel C′ p during time T S (C′1) + xd′ to T S (C′1) + xd′ + 2p−1 d′, where T S (C′ f ) ≤ T S (C′1) + xd′ and 1 ≤ p ≤ f. Accordingly, the client downloads at least one segment in every time length d′ during time T S (C′1) + xd′ to T S (C′1) + xd′ + 2f−1 d′. In addition, Step 2 of Segment Downloading shows that the client successively downloads segments \( S{\prime_{{{2^{q-1 }}}}} \) to \( S{\prime_{{{2^q}-1}}} \) from channel C′ q during time T S (C′ q ) to T S (C′ q ) + 2q−1 d′, where f + 1 ≤ q ≤ k + m. We obtain T S (C′ q ) + 2q−1 d′ = T S (C′1) + (2q − 1)d′ = T S (C′ q+1) from (3). The client starts receiving segments from channel C′ q+1 immediately after completing the downloading on the previous channel C′ q . Therefore, the client continues downloading segments during time T S (C′ f+1) to T S (C′ k+m ) + 2k+m−1 d′. We finally show that no downloading gap exists between time T S (C′1) + xd′ + 2f−1 d′ and T S (C′ f+1); that is, T S (C′1) + xd′ + 2f−1 d′ ≥ T S (C′ f+1). This study then evaluates
Accordingly, the client downloads at least one segment in every time length d′ until T S (C′ k+m ) + 2k+m−1 d′. The lemma is true.
Rights and permissions
About this article
Cite this article
Yu, HF. Extension of practical channel transition broadcasting for near video-on-demand applications. Multimed Tools Appl 70, 2369–2385 (2014). https://doi.org/10.1007/s11042-013-1436-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11042-013-1436-6