Efficient Methods to find the Equilibrium Distribution of the Number of Customers inGI/M/cQueues
From MaRDI portal
Publication:6160433
Recommendations
- ON the GI/M(n)/1/K queue-an alternative approach
- Computing steady-state queueing-time distributions of single-server queues:GI X /M/1
- Analytically elegant and computationally efficient results in terms of roots for the \(\mathrm{GI}^X/\mathrm{M}/c\) queueing system
- Analysis of the \(GI^ X/M/c\) model
- A note on some relations in the queue GI^ X/M/c
Cites work
- scientific article; zbMATH DE number 3732950 (Why is no real title available?)
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- A BAYESIAN APPROACH TO FIND RANDOM-TIME PROBABILITIES FROM EMBEDDED MARKOV CHAIN PROBABILITIES
- A comparison of the stationary distributions of GI/M/c/n and GI/M/c
- Analysis of \(\text{GI}/\text{M}/s/c\) queues using uniformisation
- Analysis of finite-buffer multi-server queues with group arrivals: GI\(^{X}\)/M/\(c\)/N
- Analysis of multi-server queues with station and server vacations
- Exact convergence rate for the distributions of \(GI\)/\(M\)/\(c\)/\(K\) queue as \(K\) tends to infinity
- On a GI/M/c Queue with Bounded Waiting Times
- Rounding errors in certain algorithms involving Markov chains
- Stationary distributions of \(GI/M/c\) queue with PH type vacations
- Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain
- The G/M/m queue with finite waiting room
- The GI/PH/1 Queue: a Method to Find The Transition Matrix
- Transient solutions in Markovian queues. An algorithm for finding them and determining their waiting-time distributions
This page was built for publication: Efficient Methods to find the Equilibrium Distribution of the Number of Customers inGI/M/cQueues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6160433)
