Perturbation analysis of a variable M/M/1 queue: A probabilistic approach

Advances in Applied Probability

Volumn 38, Issue 1, 2006, Pages 263-283

  Antunes, Nelson ^a   Fricker, Christine ^a   Guillemin, Fabrice ^b   Robert, Philippe ^a  

^a INRIA ROCQUENCOURT   (France)

^b ORANGE LABS   (France)

Author keywords

Expansion of cycle formula; M M 1 queue; Perturbation analysis

Indexed keywords

MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA; POISSON DISTRIBUTION; PROBABILITY; QUEUEING THEORY; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

CYCLE FORMULA; PERTURBATION ANALYSIS; POWER SERIES EXPANSION;

PERTURBATION TECHNIQUES;

EID: 33646087199     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1143936150     Document Type: Article

References (14)

1. Agrawal, R., Makowski, A. M. and Nain, P. (1999). On a reduced load equivalence for fluid queues under subexponentiality. Queueing Systems Theory Appl. 33, 5-41.
2. Altman, E., Avrachenkov, K. and Núñez-Queija, R. (2004). Perturbation analysis for denumerable Markov chains with application to queueing models. Adv. Appl. Prob. 36, 839-853.
3. Antunes, N., Fricker, C., Guillemin, F. and Robert, P. (2005). Integration of streaming services and TCP data transmission in the Internet. Submitted.
4. Boxma, O. J. and Kurkova, I. A. (2000). The M/M/1 queue in a heavy-tailed random environment. Statist. Neerlandica 54, 221-236.
5. Cohen, J. W. (1982). The Single Server Queue, 2nd edn. North-Holland, Amsterdam.
6. Delcoigne, F., Proutière, A. And Régnié, G. (2004). Modeling integration of streaming and data traffic. Performance Evaluation 55, 185-209.
7. Fricker, C., Guillemin, F. and Robert, P. (2004). Perturbation analysis of an M/M/1 queue in a diffusion random environment. Submitted.
8. Grandell, J. (1977). Point processes and random measures. Adv. Appl. Prob. 9, 502-526.
9. Jelenković, P. and Momčilović, P. (2002). Resource sharing with subexponential distributions. In Proc. IEEE Infocom 2002 (New York, June 2002), IEEE, pp. 1316-1325.
10. Massoulié, L. and Roberts, J. (1999). Bandwidth sharing: objectives and algorithms. In Proc. IEEE Infocom 1999 (New York, March 1999), IEEE, pp. 1395-1403.
11. Núñez-Queija, R. (2000). Sojourn times in a processor sharing queue with service interruptions. Queueing Systems 34, 351-386.
12. Núñez-Queija, R. (2001). Sojourn times in non-homogeneous QBD processes with processor sharing. Stoch. Models 17, 61-92.
13. Núñez-Queija, R. and Boxma, O.J.(1998). Analysis of a multi-server queueing model of ABR. J. Appl. Math. Stoch. Anal. 11, 339-354.
14. Robert, P. (2003). Stochastic Networks and Queues (Appl. Math. (New York) 52). Springer, New York.