A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues (Q2669671)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7486368
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues |
scientific article; zbMATH DE number 7486368 |
Statements
A simple and efficient computing procedure of the stationary system-length distributions for \(G I^X / D / c\) and \(B M a P / D / c\) queues (English)
0 references
9 March 2022
0 references
renewal input
0 references
batch arrival queue
0 references
infinite-buffer
0 references
multi-server
0 references
roots
0 references
deterministic service time
0 references
batch Markovian arrival process
0 references
0 references
0 references
0 references
0.8334276080131531
0 references
0.8275617361068726
0 references
0.8138460516929626
0 references
