Skip to main content
Springer Nature Link
Log in

Performance Analysis of a Video Streaming Buffer

  • Conference paper
Networking - ICN 2005 (ICN 2005)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3420))

Included in the following conference series:

Abstract

In this contribution, we investigate the performance of the output buffer of a video streaming server. We assume that the server encodes the video stream in a scalable way. When the output buffer gets congested, one may choose to drop the transmission of some of the layers in the packets, thus reducing the packet 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 constructed and analysed using a probability generating functions approach. We conclude with some numerical examples.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Turelli, T., Parisis, S., Bolot, J.: Experiments with a layered transmission scheme over the internet. Technical Report 3295, INRIA (1997)

    Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Agarwal, M.: 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 (2002)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. SMACS Research Group, Department TELIN, Ghent University, St-Pietersnieuwstraat 41, B-9000, Gent, Belgium

    Dieter Fiems, Stijn De Vuyst & Herwig Bruneel

Authors
  1. Dieter Fiems
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stijn De Vuyst
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Herwig Bruneel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IUT, University of Haute Alsace, 34, rue du Grillenbreit, P.O. Box, 68008, Colmar, France

    Pascal Lorenz

  2. Cisco Systems, Inc., 10 West Tasman Drive, Bldg O/2, 95134, San Jose, CA, USA

    Petre Dini

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fiems, D., De Vuyst, S., Bruneel, H. (2005). Performance Analysis of a Video Streaming Buffer. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31956-6_105

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31956-6_105

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25339-6

  • Online ISBN: 978-3-540-31956-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics