A new recursion for the queue length distribution in the stationary BMAP/G/1 queue

Communications in Statistics. Part C: Stochastic Models

Volumn 16, Issue 2, 2000, Pages 335-341

  Takine, Tetsuya ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000550460     PISSN: 08820287     EISSN: None     Source Type: Journal    
DOI: 10.1080/15326340008807590     Document Type: Article

References (7)

1. Le Boudec, J.-Y. (1991) An efficient solution method for Markov models of ATM links with loss priorities. IEEE J. Select. Areas Comm. 9, 408-417.
2. Lucantoni, D. M. (1991) New results on the single server queue with a batch Markovian arrival process. Stoch. Mod. 7, 1-46.
3. Lucantoni, D. M. (1993) The BMAP/G.1 queue: A tutorial. Models and Techniques for Performance Evaluation of Computer and Communication Systems, L. Donatiello and R. Nelson (eds.), 330-358, Springer-verlag, New York.
4. Lucantoni, D. M., Meier-Hellstern, K. S. and Neuts, M. F. (1990) A single-server queue with server vacations and a class of non-renewal arrival processes. Adv. Appl. Prob. 22, 676-705.
5. Neuts, M. F. (1998) Structured Stochastic Matrices of M/G/1 Type and Their Applications. Marcel Dekker, New York.
6. Ramaswami, V. (1988) Stable recursion for the steady state vector in Markov chains of M/G/1 type. Stoch. Mod. 4, 183-188.
7. Takine, T. and Takahashi, Y. (1998) On the relationship between queue lengths at a random instant and at a departure in the stationary queue with BMAP arrivals. Stoch. Mod. 14, 601-610.