Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline (Q2307283)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline |
scientific article |
Statements
Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline (English)
0 references
27 March 2020
0 references
finite- and infinite-buffer queue
0 references
vacation(s)
0 references
batch Markovian arrival process
0 references
gated-limited service
0 references
partial batch acceptance strategy
0 references
0 references
0 references
0 references
0 references
