Computation of the moments of queue length in the BMAP∕SM∕1 queue

The BMAP∕SM∕1 queue is the most general single-server queueing model which can be analysed analytically. Problem of computation of stationary distributions of queue length is solved in the literature. However, the problem of computation of the moments of these distributions is not enough addressed. This problem is more complicated than its particular case when the service times are independent identically distributed random variables due to reducibility of some involved matrices. In this communication, we solve this problem. © 2017 Elsevier B.V.

Authors
Klimenok V. 1, 2 , Dudin A.N. 1, 2 , Samouylov K. 2
Journal
Operations Research Letters
Publisher
Elsevier B.V.
Number of issue
5
Language
English
Pages
467-470
Status
Published
Link
External link
DOI
10.1016/j.orl.2017.07.003
Volume
45
Year
2017
Organizations
  • 1 Department of Applied Mathematics and Computer Science, Belarusian State University, 4, Nezavisimosti Ave., Minsk, 220030, Belarus
  • 2 Department of Applied Probability and Informatics, RUDN University, 6, Miklukho-Maklaya st., Moscow, 117198, Russian Federation
Keywords
Batch Markovian arrival process; Moments of queue length; Semi-Markovian service
Date of creation
19.10.2018
Date of change
25.05.2021
Short link
https://repository.rudn.ru/en/records/article/record/5339/
Share

Other records

ELEMENT STATUS OF STUDENTS WITH DIFFERENT LEVELS OF ADAPTATION

Article
Notova S.V., Kiyaeva E.V., Radysh I.V., Laryushina I.E., Blagonravov M.L.
Bulletin of Experimental Biology and Medicine. New York Consultants BureauSpringer / Автономная некоммерческая организация Издательство Российской академии медицинских наук. Vol. 163. 2017. P. 590-593