The stationary G/G/\(s\) queue with non-identical servers (Q1270300)
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: The stationary G/G/\(s\) queue with non-identical servers |
scientific article; zbMATH DE number 1214054
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The stationary G/G/\(s\) queue with non-identical servers |
scientific article; zbMATH DE number 1214054 |
Statements
The stationary G/G/\(s\) queue with non-identical servers (English)
0 references
14 October 1999
0 references
The factorization method developed earlier for the \(\text{G/G/} s\) queue [refer \textit{P. Le Gall}, ibid. 11, No. 1, 59-71 (1998; Zbl 0910.60071)] is extended to the case of non-identical servers. The characterization of the system by three simple properties leads to a numerical calculation method. The simplicity of this method in the case of \(\text{GI/G/}s\) queue is illustrated by providing numerical comparison of the results with those obtained by Markovian (phase) method for symmetrical \(\text{M/E}_2\)/
0 references
GI/G/\(s\) queue
0 references
first come first served
0 references
factorization
0 references
singular point
0 references