A two-moment approximation for the GI/G/c queue with finite capacity
From MaRDI portal
Publication:2890458
Recommendations
- Simple Approximations for the GI/G/c Queue-II: The Moments, the Inverse Distribution Function and the Loss Function of the Number in the System and of the Queue Delay
- A Transform-Free Approximation for the Finite Capacity M/G/s Queue
- Approximations for the GI/G/c queue
- A Two-Moment Approximation for the Mean Waiting Time in the GI/G/s Queue
- Transform-free analysis of the \(GI/G/1/K\) queue through the decomposed little's formula
Cited in
(12)- Simple Approximations for the GI/G/c Queue-II: The Moments, the Inverse Distribution Function and the Loss Function of the Number in the System and of the Queue Delay
- Properties and performance modelling of finite buffer \(M/G/1/K\) networks
- M/G/c/K PERFORMANCE MODELS IN MANUFACTURING AND SERVICE SYSTEMS
- Topological network design of general, finite, multi-server queueing networks
- NOTE ON APPROXIMATIONS FOR THE MULTISERVER QUEUE WITH FINITE BUFFER AND DETERMINISTIC SERVICES
- Transform-free analysis of the \(GI/G/1/K\) queue through the decomposed little's formula
- On the two-moment approximation of the discrete-time \(\mathrm{GI}/\mathrm{G}/1\) queue with a single vacation
- On the total customers' capacity in multi-server queues
- Performance optimization of open zero-buffer multi-server queueing networks
- Capacity planning of a perinatal network with generalised loss network model with overflow
- Closed-form approximations for the URLLC capacity using \(G/G/s\) queues
- Correction to: ``Extremal \(GI/GI/1\) queues given two moments: exploiting Tchebycheff systems
This page was built for publication: A two-moment approximation for the \(GI/G/c\) queue with finite capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890458)
