Approximations for the GI/G/c queue

DOI10.2307/3214189zbMath0602.60082OpenAlexW4241387486MaRDI QIDQ3738366

M. H. van Hoorn, L. P. Seelen

Publication date: 1986

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3214189

zbMATH Keywords

mean queue lengthmixture of Erlang distributionsdelay probabilitygood approximation for moderate and heavy traffics

Mathematics Subject Classification ID

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

Related Items (8)

Analysis of the stationary \(E_ k/C_ 2/s\) queueing system ⋮ Predicting the performance of queues -- a data analytic approach ⋮ A NEW APPROACH FOR THE STUDY OF THE M^X/G/1 QUEUE USING RENEWAL ARGUMENTS ⋮ NOTE ON APPROXIMATIONS FOR THE MULTISERVER QUEUE WITH FINITE BUFFER AND DETERMINISTIC SERVICES ⋮ Exact and approximate numerical solutions of steady-state distributions arising in the queue \(GI/G/1\) ⋮ Transient flows in queueing systems via closure approximations ⋮ A Moment-Iteration Method for Approximating the Waiting-Time Characteristics of the GI/G/1 Queue ⋮ NEGATIVE PROBABILITIES AT WORK IN THE M/D/1 QUEUE

This page was built for publication: Approximations for the GI/G/c queue