| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5128378 | Operations Research Letters | 2017 | 4 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
V. Klimenok, A.N. Dudin, K. Samouylov,