On the calculation of steady-state loss probabilities in the GI/G/2/0 queue
Summary: This paper considers methods for calculating the steady-state loss probability in the \(GI/G/2/0\) queue. A previous study analyzed this queue in discrete time and this led to an efficient, numerical approximation scheme for continuous-time systems. The primary aim of the present work is to provide an alternative approach by analyzing the \(GI/ME/2/0\) queue; i.e., assuming that the service time can be represented by a matrix- exponential distribution. An efficient computational scheme based on this method is developed and some numerical examples are studied. Some comparisons are made with the discrete-time approach, and the two methods are seen to be complementary.
- Calculating steady-state probabilities of the \(G/M/n/m\) queueing systems
- scientific article; zbMATH DE number 1031393
- The General Two-Server Queueing Loss System: Discrete-Time Analysis and Numerical Approximation of Continuous-Time Systems
- scientific article; zbMATH DE number 934838
- Computing loss probabilities in discrete-time queues
- Ergodic and light traffic properties of a complex repairable system
- Conditions for the light-traffic insensitivity to loss probability in a \(\text{GI}/ \text{G}/m/0\) queueing system
- Calculation of steady-state probabilities of M/M queues: Further approaches
- A review of my scientific publications. Masters and coworkers
- Two new heuristics for the GI/G/n/0 queueing loss system with examples based on the two-phase Coxian distribution
- Characterization of Matrix-Exponential Distributions
- scientific article; zbMATH DE number 1031393 (Why is no real title available?)
- The General Two-Server Queueing Loss System: Discrete-Time Analysis and Numerical Approximation of Continuous-Time Systems
- Calculating steady-state probabilities of the \(G/M/n/m\) queueing systems
This page was built for publication: On the calculation of steady-state loss probabilities in the \(GI/G/2/0\) queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344656)