A recursive equations based representation for the G/G/m queue

DOI10.1016/0893-9659(94)90116-3MaRDI QIDQ1328799zbMATH OpenOpenAlexFDO

Authors Nikolai Krivulin

Publication date 7 August 1994

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.6012

zbMATH Keywords

multi-channel queueoutput processqueueing networksrecursive equations

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Abstract: New recursive equations designed for the G/G/m queue are presented. These equations describe the queue in terms of recursions for the arrival and departure times of customers, and involve only the operations of maximum, minimum and addition.

Review text

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)].

Recommendations

• An Analytic Approach to a General Class of G/G/s Queueing Systems
• On the input-output map of aG/G/1 queue
• Queueing output processes
• A note on the equilibrium M/G/1 queue length
• scientific article; zbMATH DE number 3885083

Cites work

• Acyclic fork-join queuing networks
• scientific article; zbMATH DE number 4167810 (Why is no real title available?)
• scientific article; zbMATH DE number 3072483 (Why is no real title available?)
• On the Theory of Queues With Many Servers
• Stochastic convexity and its applications
• Unbiased estimates for gradients of stochastic network performance measures

Cited in

(7)

• A max-algebra approach to modeling and simulation of tandem queueing systems
• A hybrid method for performance analysis of \(G/G/m\) queueing networks
• Robust queueing theory
• Recursive Solutions for the Generalized Erlang Queueing Systems
• Poisson's equation for the recurrent M/G/1 queue
• System of recursive equations for the partition functions of 1D models
• Robust transient analysis of multi-server queueing systems and feed-forward networks

This page was built for publication: A recursive equations based representation for the \(G/G/m\) queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328799)