On a modified M/M/$m$/$n$ queueing model
The classic M/M/$m$/$n$ queueing model is modified by allowing a given task to require up to $m$ servers to be performed. Moreover, the maximum time that a task can wait in the queue before being executed is a random variable having an exponential distribution. Both FIFO (First In, First Out) and pr...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
2021-04-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/files/csjm/v29-n1/v29-n1-(pp29-40).pdf |