A recursive equations based representation for the \(G/G/m\) queue (Q1328799): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / reviewed by
 
Property / reviewed by: Q1180565 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jevsey Morozov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978136523 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1210.6012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5811575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic fork-join queuing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3494350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbiased estimates for gradients of stochastic network performance measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic convexity and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Theory of Queues With Many Servers / rank
 
Normal rank

Latest revision as of 16:05, 22 May 2024

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