Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time (Q319322)
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: Algorithm for computing the queue length distribution at various time epochs in DMAP/G^(1, a, b)/1/n queue with batch-size-dependent service time |
scientific article; zbMATH DE number 6633502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time |
scientific article; zbMATH DE number 6633502 |
Statements
Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time (English)
0 references
6 October 2016
0 references
queueing
0 references
batch-size-dependent service
0 references
Markovian arrival process
0 references
phase-type distribution
0 references
finite-buffer
0 references
0 references
0 references
0 references
0 references
0 references
0.8627127408981323
0 references
0.8400890231132507
0 references
0.8330932259559631
0 references
0.8305212259292603
0 references
0.8270666599273682
0 references
