An Approximation Method for the Analysis of GI/G/1 Queues
From MaRDI portal
Publication:4367271
Recommendations
- An approximation method for the analysis of GI/G/1 queues
- Characterizing the idle-period distribution of GI/G/1 queues
- Numerical approximations for the steady-state waiting times in a GI/G/1 queue
- A functional approach to the stationary waiting time and idle period distributions of the \(GI/G/1\) queue
- A Moment-Iteration Method for Approximating the Waiting-Time Characteristics of the GI/G/1 Queue
Cited in
(16)- Analysis of the M/G/1 processor-sharing queue with bulk arrivals
- Regenerative Simulation for Queueing Networks with Exponential or Heavier Tail Arrival Distributions
- Approximating the tandem behaviour of a G|M|1 queueing system
- A functional approach to the stationary waiting time and idle period distributions of the \(GI/G/1\) queue
- Applying Foster's criteria to a \(GI/PH/1\) queueing system
- Perturbation analysis of the \(\mathrm{GI}/\mathrm{M}/s\) queue
- Approximating the ΣGI/G/squeue by Using Aggregation and Matrix Analytic Methods
- A hybrid method for performance analysis of \(G/G/m\) queueing networks
- Accelerated consistent estimation of a high load probability in \(M/G/1\) and \(GI/G/1\) queues
- Approximation of the queue-length distribution of an M/GI/s queue by the basic equations
- A Moment-Iteration Method for Approximating the Waiting-Time Characteristics of the GI/G/1 Queue
- Consistency of infinitesimal perturbation analysis for the GI/G/m queue
- An approximation method for the analysis of GI/G/1 queues
- ON APPROXIMATIONS FOR GI/G/c RETRIAL QUEUES
- Analytical methods for analysis of queueing system \(GI| G_ r| 1|\infty\) with relative priority
- Approximations for waiting time in GI/G/1 systems
This page was built for publication: An Approximation Method for the Analysis of GI/G/1 Queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367271)
