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

DOI10.1016/0893-9659(94)90116-3zbMath0808.60078arXiv1210.6012OpenAlexW1978136523MaRDI QIDQ1328799

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

output processqueueing networksrecursive equationsmulti-channel queue

Mathematics Subject Classification ID

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

Related Items

Robust Queueing Theory ⋮ A max-algebra approach to modeling and simulation of tandem queueing systems ⋮ A hybrid method for performance analysis of \(G/G/m\) queueing networks ⋮ System of recursive equations for the partition functions of 1D models ⋮ Robust transient analysis of multi-server queueing systems and feed-forward networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unbiased estimates for gradients of stochastic network performance measures
• Stochastic convexity and its applications
• Acyclic fork-join queuing networks
• On the Theory of Queues With Many Servers