Efficient computational analysis of stationary probabilities for the queueing system \(BMAP/G/1/N\) with or without vacation(s) (Q5739136)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient computational analysis of stationary probabilities for the queueing system BMAP/G/1/N with or without vacation(s) |
scientific article; zbMATH DE number 6725576
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computational analysis of stationary probabilities for the queueing system \(BMAP/G/1/N\) 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
0.8576985001564026
0 references
0.8482528924942017
0 references
0.8316931128501892
0 references
0.8311951756477356
0 references
