. Finally, ) expresses w(m, m ? , n) in terms of w(m ? 1, ·, ·) so that (B.3) can be used to recursively calculate all w's by iterating over m. There are O(N 3 ) unknown w's, while it takes O(N) operations per w

S. Akhshabi, A. C. Begen, and C. Dovrolis, An experimental evaluation of rate-adaptation algorithms in adaptive streaming over HTTP, Proceedings of the Second Annual ACM Conference on Multimedia Systems, MMSys '11, pp.157-168, 2011.

V. Jacobson, Congestion avoidance and control, Proceedings of ACM SIGCOMM, pp.314-329, 1988.

, Cooperative Association for Internet Data Analysis, Analyzing UDP usage in Internet

K. Cho, K. Mitsuya, and A. Kato, Traffic data repository at the WIDE project, USENIX 2000 FREENIX Track, 2000.

P. Hurley, J. L. Boudec, M. Kara, and P. Thiran, A novel scheduler for a low delay service within best-effort, Quality of Service -IWQoS 2001: 9th International Workshop Karlsruhe, pp.389-403, 2001.

M. Podlesny and S. Gorinsky, RD network services: differentiation through performance incentives, Proceedings of the ACM SIGCOMM, pp.255-266, 2008.

L. Kleinrock, Queueing Systems, vol.2, 1976.

J. Cohen, The Single Server Queue, 1982.

N. , Priority Queues, 1968.

H. Takagi, Queueing Analysis: A Foundation of Performance Evaluation, Vacation and Priority Systems, vol.1, 1991.

D. Wagner and U. R. Krieger, Analysis of a finite buffer with nonpreemptive priority scheduling, Comm. Statist. Stoch. Models, vol.15, pp.345-365, 1999.

J. Van-velthoven, B. Van-houdt, and C. Blondia, The impact of buffer finiteness on the loss rate in a priority queueing system, Lecture Notes in Comput. Sci, vol.4054, pp.211-225, 2006.

A. Bondi, An analysis of finite capacity queues with priority scheduling and common or reserved waiting areas, Comput. Oper. Res, vol.16, pp.217-233, 1989.

D. Fiems, J. Walraevens, and H. Bruneel, Performance of a partially shared priority buffer with correlated arrivals, Proc. of the 20th International Teletraffic Congress, vol.20, pp.582-593, 2007.

T. Demoor, D. Fiems, J. Walraevens, and H. Bruneel, Partially shared buffers with full or mixed priority, J. Ind. Manag. Optim, vol.7, issue.3, pp.735-751, 2011.

K. Al-begain, A. Dudin, and V. Mushko, Novel queueing model for multimedia over downlink in 3.5G wireless network, Proc. of the 12th International Conference on Analytical and Stochastic Modelling Techniques and Applications, pp.111-117, 2005.

X. Cheng and F. Akyildiz, A finite buffer two class queue with different scheduling and push-out schemes, pp.231-241, 1992.

Y. Lee, B. D. Choi, B. Kim, and D. K. Sung, Delay analysis of an M/G/1/K priority queueing system with push-out scheme, Math. Probl. Eng, vol.12, 2007.

A. S. Kapadia, M. F. Kazmi, and A. C. Mitchell, Analysis of a finite capacity nonpreemptive priority queue, Comput. Oper. Res, vol.11, pp.337-343, 1984.

Y. Lee and B. D. Choi, Queueing system with multiple delay and loss priorities for ATM networks, Inform. Sci, vol.138, issue.1, pp.7-29, 2001.

K. E. Avrachenkov, G. L. Shevlyakov, and N. O. Vilchevskii, Randomized push-out disciplines in priority queueing, J. Math. Sci, vol.122, issue.4, 2004.

K. E. Avrachenkov, N. O. Vilchevsky, and G. L. Shevlyakov, Priority queueing with finite buffer size and randomized push-out mechanism, Perform. Eval, vol.61, issue.1, pp.1-16, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00072154

M. Reiman and B. Simon, An interpolation approximation for queueing systems with Poisson input, Oper. Res, vol.36, pp.454-469, 1988.

J. Walrand, Handbooks in Operations Research and Management Science, vol.2, pp.519-603, 1990.

K. Avrachenkov, J. Filar, and P. Howlett, Analytic Perturbation Theory and its Applications, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00926397