Performance Analysis of a Video Streaming Buffer

  • Dieter Fiems
  • Stijn De Vuyst
  • Herwig Bruneel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3420)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Turelli, T., Parisis, S., Bolot, J.: Experiments with a layered transmission scheme over the internet. Technical Report 3295, INRIA (1997)Google Scholar
  2. 2.
    Radha, H., Chen, Y., Parthasarathy, K., Cohen, R.: Scalable internet video using MPEG-4. Signal Processing: Image Communication 15, 95–126 (1999)CrossRefGoogle Scholar
  3. 3.
    Kangasharju, J., Hartanto, F., Reisslein, M., Ross, K.: Distributing layered encoded video through caches. IEEE Transactions on Computers 51, 622–636 (2002)CrossRefGoogle Scholar
  4. 4.
    Zwart, A.: Tail asymptotics for the busy period in the GI/G/1 queue. Mathematics of Operations Research 26, 485–493 (2001)MATHCrossRefMathSciNetGoogle Scholar
  5. 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)MATHCrossRefMathSciNetGoogle Scholar
  6. 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. 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)MATHCrossRefMathSciNetGoogle Scholar
  8. 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)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Dieter Fiems
    • 1
  • Stijn De Vuyst
    • 1
  • Herwig Bruneel
    • 1
  1. 1.SMACS Research Group, Department TELINGhent UniversityGentBelgium

Personalised recommendations