Efficient Computational Analysis of Stationary Probabilities for the Queueing System <i>BMAP</i>/<i>G</i>/1/<i>N</i> With or Without Vacation(s) (Q5739136)
From MaRDI portal
scientific article; zbMATH DE number 6725576
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Computational Analysis of Stationary Probabilities for the Queueing System <i>BMAP</i>/<i>G</i>/1/<i>N</i> With or Without Vacation(s) |
scientific article; zbMATH DE number 6725576 |
Statements
Efficient Computational Analysis of Stationary Probabilities for the Queueing System <i>BMAP</i>/<i>G</i>/1/<i>N</i> With or Without Vacation(s) (English)
0 references
2 June 2017
0 references
finite-buffer queue
0 references
batch Markovian arrival process
0 references
single server
0 references
partial batch rejection policy
0 references
single- and multiple-vacation policy
0 references
Pareto service time distribution
0 references
