Analysis of a queue in the BMAP=G=1=N system

International Journal of Simulation: Systems, Science and Technology

Volumn 6, Issue 1-2, 2005, Pages 13-23

  Dudin, Alexander N ^a   Shaban, Alexey A ^a   Klimenok, Valentina I ^a  

^a BELARUSIAN STATE UNIVERSITY   (Belarus)

Author keywords

Batch Markovian Arrival Process; Complete admission; Complete rejection; Finite queue; Loss Probability

Indexed keywords

LOSS OF LOAD PROBABILITY; MARKOV PROCESSES; QUEUEING NETWORKS;

BATCH MARKOVIAN ARRIVAL PROCESS; COMPLETE ADMISSION; COMPLETE REJECTION; FINITE QUEUE; LOSS PROBABILITY;

QUEUEING THEORY;

EID: 33746894844     PISSN: 14738031     EISSN: 1473804X     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. Blondia C. 1989. “The N=G=1 finite capacity queue". Communications in Statistics | Stochastic Models 5: 273-294.
2. Chakravarthy S. R. 2001. “The batch Markovian arrival process: a review and future work" Ad- vances in Probability Theory and Stochastic Process: Proc. / eds. Krishnamoorthy A. et al. NJ: Notable Publications: 21-49.
3. Cinlar E. 1975. “Introduction to stochastic pro- cesses." New Jersey. Prentice-Hall.
4. Dudin A. N. and Karolik A. V. 2001. “BMAPjSMj1 queue with Markovian in- put of disasters and non-instantaneous recovery." Performance Evaluation 45, No. 1: 19-32.
5. Dudin A. N., Klimenok V. I. and Tsarenkov G. V. 2002a. “Characteristics calculation for a sin- gle server queue with the batch Markovian ar- rival process, semi-Markovian service and finite buffer." Automation and Remote Control 63, No. 8: 87-100.
6. Dudin A. N., Klimenok V. I. and Tsarenkov G. V. 2002b. “Software “SIRIUS++" for performance evaluation of modern communication networks". Modelling and Simulation 2002. 16th European Simulation Multi-conference. Darmstadt, 489- 493.
7. Dudin A. N., Klimenok V.I., Tsarenkov G.V., Se- menova O.V. and Birukov A.A. 2004. “Software “SIRIUS-C" for synthesis of optimal control by queues" Proceedings of 11-th International Con- ference on Analytical and Stochastic Modelling Techniques and Applications (ASMTA 2004). Magdeburg, 123-129.
8. Dudin A. N. and Nishimura S. 2000. “Optimal hysteretic control for a BMAP/SM/1/N queue with two operation modes". Mathematical Problems in Engineering 5, No.5: 397-420.
9. Klimenok V. I. 2002. “Quasitoeplitz and asymptotically quasitoeplitz Markov chains and their application in queueing theory." Minsk, Belaru- sian State University.
10. Klimenok V. I. and Dudin A. N. 2003. “Application of censored Markov chains for calculating the stationary distribution of the multi-dimensional left-skip-free Markov chains." Queues: flows, systems, networks 17: 121-128.
11. Lucantoni D. M. 1991. “New results on the single server queue with a batch markovian arrival pro- cess." Commun. Statist.--Stochastic Models 7: 1-46.