Approximation of the Overflow Process from a <i>G</i>/<i>M</i>/<i>N</i>/<i>K</i> Queueing System (Q3784966)
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 4046859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation of the Overflow Process from a <i>G</i>/<i>M</i>/<i>N</i>/<i>K</i> Queueing System |
scientific article; zbMATH DE number 4046859 |
Statements
Approximation of the Overflow Process from a <i>G</i>/<i>M</i>/<i>N</i>/<i>K</i> Queueing System (English)
0 references
1987
0 references
overflow process
0 references
stationary counting arrival process
0 references
Numerical results
0 references
approximation
0 references
0.8605124354362488
0 references
0.8535893559455872
0 references
0.8327465057373047
0 references
0.8293905854225159
0 references
0.8157832026481628
0 references
