Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

An analytic study of a scalable video buffer

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In this contribution, we investigate the performance of the output buffer of an ‘on-demand’ video streaming server. The server maintains a local database of stored video clips and movies which can be streamed to the users upon request. We assume that the stored video is encoded in a scalable way, which means that the data streams contain a base layer ensuring a minimum of guaranteed quality and a stack of additional enhancement layers progressively improving the quality of the video. For the purpose of performance analysis, we assume that a video stream is split up in logical units called frames. Every frame consists of a number of packets, each containing information of one layer only. When the output buffer gets congested, one may choose to drop the transmission of some of the layers in a frame, thus reducing the frame transmission time and expediting the restoration of the buffer size to normal levels. A discrete-time finite capacity queueing model with buffer size dependent transmission times is proposed. Using a probability generating function approach, we focus on the characteristics of idle and busy periods. We obtain performance measures such as the frame loss ratio and the average frame transmission time. The latter measure relates to the quality of the video stream. We conclude with some numerical examples, including a realistic case study.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Agarwal, M. (2002). Distribution of number served during a busy period of GI/M/1/N queues—lattice path approach. Journal of Statistical Planning and Inference, 101, 7–21.

    Article  Google Scholar 

  2. Artalejo, J. R., & Lopez-Herrero, M. J. (2001). Analysis of the busy period for the M/M/c queue: an algorithmic approach. Journal of Applied Probability, 38(1), 209–222.

    Article  Google Scholar 

  3. Baltrūnas, A., Daley, D. J., & Klüppelberg, C. (2004). Tail behaviour of the busy period of a GI/GI/1 queue with subexponential service times. Stochastic Processes and Their Applications, 111, 237–258.

    Article  Google Scholar 

  4. Beran, J., Sherman, R., Taqqu, M. S., & Willinger, W. (1996). Long-range dependence in variable-bit-rate video traffic. IEEE Transactions on Communications, 43(2/3/4), 1566–1579.

    Google Scholar 

  5. Chandra, K., & Reibman, A. R. (1999). Modeling one- and two-layer variable bit rate video. IEEE/ACM Transactions on Networking, 7(3), 398–413.

    Article  Google Scholar 

  6. Garrett, M. W., & Willinger, W. (1994). Analysis, modelling and generation of self-similar VBR video traffic. In Proceedings of ACM/SIGCOMM ’94 (pp. 269–280). London, UK, 31 August–2 September 1994.

  7. Grossglauser, M., & Bolot, J.-C. (1999). On the relevance of long-range dependence in network traffic. IEEE/ACM Transactions on Networking, 7(5), 629–640.

    Article  Google Scholar 

  8. Heyman, D. P., & Lakshman, T. V. (1996). What are the implications of long-range dependence for VBR-video traffic engineering? IEEE/ACM Transactions on Networking, 4(3), 301–317.

    Article  Google Scholar 

  9. Kangasharju, J., Hartanto, F., Reisslein, M., & Ross, K. W. (2002). Distributing layered encoded video through caches. IEEE Transactions on Computers, 51(6), 622–636.

    Article  Google Scholar 

  10. Li, W. (2001). Overview of fine granularity scalability in MPEG-4 video standard. IEEE Transactions on Circuits and Systems for Video Technology, 11(3), 301–317.

    Article  Google Scholar 

  11. Mian, S. H. (2004). Analysis of MPEG-4 scalable encoded video. IEE Proceedings: Communications, 151(3), 270–279.

    Article  Google Scholar 

  12. Ohta, C., & Morii, M. (2002). Moment calculating algorithm for busy-period of discrete-time finite-capacity M/G/1 type queue. IEICE Transactions on Communications, E85B(1), 293–304.

    Google Scholar 

  13. Pacheco, A., & Ribeiro, H. (2006). Algorithms for computing moments of the length of busy periods of single-server systems.

  14. Radha, H., Chen, Y., Parthasarathy, K., & Cohen, R. (1999). Scalable Internet video using MPEG-4. Signal Processing: Image Communication, 15, 95–126.

    Article  Google Scholar 

  15. Turelli, T., Parisis, S. F., & Bolot, J. (1997). Experiments with a layered transmission scheme over the Internet (Technical Report 3295). INRIA.

  16. Wu, D., Hou, Y. T., & Zhang, Y.-Q. (2001). Scalable video coding and transport over broadband wireless networks. IEEE Proceedings, 89(1), 6–20.

    Article  Google Scholar 

  17. Zhao, J.-A., Li, B., & Ahmad, I. (2003). Traffic model for layered video: an approach on Markovian arrival process. In Proceedings of packet video 2003, Nantes, France, April 2003.

  18. Zwart, A. P. (2001). Tail asymptotics for the busy period in the GI/G/1 queue. Mathematics of Operations Research, 26(3), 485–493.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dieter Fiems.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fiems, D., De Vuyst, S., Wittevrongel, S. et al. An analytic study of a scalable video buffer. Telecommun Syst 41, 25–36 (2009). https://doi.org/10.1007/s11235-009-9148-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-009-9148-y

Keywords