A recursive equations based representation for the \(G/G/m\) queue (Q1328799)

From MaRDI portal
Revision as of 19:05, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A recursive equations based representation for the \(G/G/m\) queue
scientific article

    Statements

    A recursive equations based representation for the \(G/G/m\) queue (English)
    0 references
    0 references
    7 August 1994
    0 references
    The outputs of a \(G/ G/ m\) queue are presented as recursive equations including operators max, min and ``+'' only. One can note that the close result has been obtained for general queueing networks by \textit{J. G. Shanthikumar} and \textit{D. D. Yao} [J. Appl. Probab. 26, No. 2, 413-417 (1989; Zbl 0686.60099)].
    0 references
    multi-channel queue
    0 references
    output process
    0 references
    recursive equations
    0 references
    queueing networks
    0 references

    Identifiers