A numerical solution for the multi-server queue with hyper-exponential service times (Q789115)
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 3844799
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A numerical solution for the multi-server queue with hyper-exponential service times |
scientific article; zbMATH DE number 3844799 |
Statements
A numerical solution for the multi-server queue with hyper-exponential service times (English)
0 references
1983
0 references
In this paper we present a numerical method for the \(GI| H_ 2| s\). It is based on a general solution for \(GI| H_ m| s\) which has been obtained using explicit matrix factorizations methods. We give a complete description of the algorithm which yields exact results for the complete steady state distributions of the actual waiting, the virtual waiting and the number of customers in the system both at arrival epochs and in continuous time. Some numerical examples are included.
0 references
multi-server queue
0 references
hyper-exponential service times
0 references
actual waiting time
0 references
virtual waiting time
0 references
queue length
0 references
steady state distributions
0 references
0.8212085366249084
0 references
0.8126229643821716
0 references
0.7895515561103821
0 references
0.7854909300804138
0 references
0.783528208732605
0 references
