Stationary characteristics of unreliable queueing system with a batch Markovian arrival process
Abstract
Unreliable queuing systems are of considerable interest both in mathematical terms and for applications. Systems with stationary Poisson flows of customers and breakdowns and exponentially distributed service and repair times are mainly considered. This circumstance greatly simplifies the mathematical analysis of the corresponding models but rarely occurs in real systems, especially in telecommunications networks. The purpose of this study is to analyze the stationary behavior of a multi-server unreliable queueing system with a batch Markovian arrival process, which takes into account the correlation and bursty nature of real traffic. The service and repair processes are described by phase type distributions which makes it possible to take into account not only the average service and repair times but also the variance of these times. As a result of the research, the operation of the system is described by a multi-dimensional Markov chain. The condition of ergodicity of this chain is presented in a simple algorithmic form. An algorithm for calculating the stationary distribution is proposed. Formulas for the key performance characteristics of the system are obtained in terms of the stationary distribution of the Markov chain describing the system dynamics. The results can be used to make expert decisions in analyzing the performance and design of various telecommunication networks.
Keywords
queuing system,
unreliable servers,
batch Markovian arrival process,
phase type distribution,
stationary distribution,
performance characteristics
Supporting agencies: This work has been financially supported by the joint grant of Belarusian Republican Foundation for Fundamental Research (no. F18R-136) and Russian Foundation for Fundamental Research (no. 18-57-00002).
About the Author
V. I. Klimenok
Belarusian State University
Belarus
Belarus
Dr. Sci. (Phys.-Math.), Professor, Chief Researcher of the Research Laboratory of Applied Probabilistic Analysis
References
1. Kuoa C. C., Sheub S. H., Ke J. C., Zhang Z. G. Reliability-based measures for a retrial system with mixed standby components. Applied Mathematical Modelling, 2014, vol. 38, pp. 4640–4651.
2. Hsu Y. L., Ke J. C., Liu T. H., Wu C. H. Modeling of multi-server repair problem with switching failure and reboot delay and related profit analysis. Computers and Industrial Engineering, 2014, vol. 69, pp. 21–28.
3. Wu C. H., Ke J. C. Multi-server machine repair problems under a ( , synchronous single vacation policy. Applied Mathematical Modelling, 2014, vol. 38, pp. 2180–2189.
4. Klimenok V. I., Dudin A. N. A / / queue with negative customers and partial protection of service. Communications in Statistics – Simulation and Computation, 2012, vol. 41, pp. 1062–1082.
5. Dudin A., Kim C. S., Dudin S., Dudina O. Priority retrial queueing model operating in random environment with varying number and reservation of servers. Applied Mathematics and Computations, 2015, vol. 269, pp. 674–690.
6. Lucantoni D. New results on the single server queue with a batch Markovian arrival process. Communications in Statistics. Stochastic Models, 1991, vol. 7, pp. 1–46.
7. Neuts M. F. Matrix-Geometric Solutions in Stochastic Models. Baltimore, The Johns Hopkins University Press, 1981, 352 р.
8. Graham A. Kronecker Products and Matrix Calculus with Applications. Cichester, Ellis Horwood, 1981, 130 р.
9. Klimenok V. I., Dudin A. N. Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory. Queueing Systems, 2006, vol. 54, pp. 245–259.
Review
For citations:
Klimenok V.I. Stationary characteristics of unreliable queueing system with a batch Markovian arrival process. Informatics. 2019;16(3):69-78. (In Russ.)
Views: 808
Email this article 