Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

Analysis of BMAP(r)/M(r)/N(r) Type Queueing System Operating in Random Environment

BMAP(r)/M(r)/N(r) 대기행렬시스템 분석

  • Kim, Chesoong (Department of Business Administration, Sangji University) ;
  • Dudin, Sergey (Department of Applied Mathematics and Computer Science, Belarusian State University)
  • Received : 2015.06.01
  • Accepted : 2015.11.30
  • Published : 2016.02.15
Download PDF
⟨ Previous Next ⟩

Abstract

A multi-server queueing system with an infinite buffer and impatient customers is analyzed. The system operates in the finite state Markovian random environment. The number of available servers, the parameters of the batch Markovian arrival process, the rate of customers' service, and the impatience intensity depend on the current state of the random environment and immediately change their values at the moments of jumps of the random environment. Dynamics of the system is described by the multi-dimensional asymptotically quasi-Toeplitz Markov chain. The ergodicity condition is derived. The main performance measures of the system are calculated. Numerical results are presented.

Keywords

References

  1. Chakravarthy, S. R. (2001), The batch Markovian arrival process : a review and future work Advances, In : Krishnamoorthy A et al. (Eds.), Probability Theory and Stochastic Processes, NJ : Notable Publications, 21-49.
  2. Choi, D. I., Kim, B. K., and Lee, D. H. (2014), A Note on the M/G/1/K Queue with Two-Threshold Hysteresis Strategy of Service Intensity Switching, Journal of the Korean Operations Research and Management Science Society, 39(3), 1-5. https://doi.org/10.7737/JKORMS.2014.39.3.001
  3. Cordeiro, J. D. and Kharoufeh, J. P. (2012), The unreliable M/M/1 retrial queue in a random environment, Stochastic Models, 28, 29-48. https://doi.org/10.1080/15326349.2011.614478
  4. Gnedenko, B. V. and Kovalenko, I. N. (1966), Introduction to queueing theory, Science, Moscow.
  5. Graham, A. (1981), Kronecker products and matrix calculus with applications, Ellis Horwood, Cichester.
  6. Kim, C. S., Dudin, A. N., Klimenok, V. I., and Khramova, V. V. (2009), Erlang loss queueing system with batch arrivals operating in a random environment, Computers and Operations Research, 36, 674-967. https://doi.org/10.1016/j.cor.2007.10.022
  7. Kim, C. S., Dudin, A., Dudin, S., and Dudina, O. (2014), Analysis of $MMAP/PH_1,PH_2/N/{\infty}$ queueing system operating in a random environment, International Journal Applied Mathematics and Computer Science, 24(3), 485-501. https://doi.org/10.2478/amcs-2014-0036
  8. Kim, C. S., Klimenok, V. I., Sang, C. L., and Dudin, A. N. (2007), The BMAP/PH/1 retrial queueing system operating in random environment, Journal of Statistical Planning and Inference, 137, 3904-3916. https://doi.org/10.1016/j.jspi.2007.04.009
  9. Kim, C. S. and Lyakhov, A. (2008), Study of Dynamic Polling in the IEEE 802.11 PCF, Journal of the Korean Institute of Industrials Engineers, 34(2), 140-150.
  10. Klimenok, V. I. and Dudin, A. N. (2006), Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory, Queueing Systems, 54, 245-259. https://doi.org/10.1007/s11134-006-0300-z
  11. Krieger, U., Klimenok, V. I., Kazimirsky, A. V., Breuer, L., and Dudin, A. N. (2005), A BMAP/PH/1 queue with feedback operating in a random environment, Mathematical and Computer Modelling, 41, 867-882. https://doi.org/10.1016/j.mcm.2004.11.002
  12. Lucantoni, D. (1991), New results on the single server queue with a batch Markovian arrival process, Communications in Statistics-Stochastic Models, 7, 1-46. https://doi.org/10.1080/15326349108807174
  13. Neuts, M. F. (1978), The M/M/1 queue with randomly varying arrival and service rates, Operations Research, 15, 139-157.
  14. Neuts, M. F. (1981), Matrix-geometric solutions in stochastic models, The Johns Hopkins University Press, Baltimore.
  15. O'Cinneide, C. and Purdue, P. (1986), The M/M/\oo queue in a random environment, Journal of Applied Probability, 23, 175-184. https://doi.org/10.2307/3214126
  16. Purdue, P. (1974), The M/M/1 queue in a Markovian environment, Operations Research, 22, 562-569. https://doi.org/10.1287/opre.22.3.562
  17. Takine, T. (2005), Single-server queues with Markov-modulated arrivals and service speed, Queueing Systems, 49, 7-22. https://doi.org/10.1007/s11134-004-5553-9
  18. Wu, J., Liu, Z., Yang, G. (2011), Analysis of the finite source MAP/PH/N retrial G-queue operating in a random environment, Applied Mathematical Modelling, 35, 1184-1193. https://doi.org/10.1016/j.apm.2010.08.006
  19. Yadin, M. and Syski, R. (1979), Randomization of intensities in a Markov chain, Advances in Applied Probability, 11, 397-421. https://doi.org/10.2307/1426846
  20. Yang, G., Yao, L. G., and Ouyang, Z. S. (2013), The MAP/PH/N retrial queue in a random environment, Acta Mathematicae Applicatae Sinica, 29, 725-738. https://doi.org/10.1007/s10255-013-0251-1
  21. Yechialy, U. and Naor, P. (1971), Queueing Problems with Heterogeneous Arrivals and Service, Operations Research, 19, 722-734. https://doi.org/10.1287/opre.19.3.722

Cited by

  1. Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks vol.78, pp.8, 2017, https://doi.org/10.1134/S000511791708001X