On inference concerning time-dependent queue performance: The M/G/1 example
The paper deals with easily-computed approximations to the finite-time expected waiting time for an M/G/1 system starting from an empty state. Both unsaturated \((\rho <1)\) and saturated \((\rho >1)\) conditions are considered. Numerical evidence is presented to indicate that the quality of the approximations is usefully good, especially when ease of computation is an issue. Further, the methodology is adapted to assess expected waiting times when inference must be made from a random sample of service times, and the decision is made to do so nonparametrically, i.e. without fitting a specific function. The results appear reasonable and potentially useful, and are not burdensome to obtain. The methodology investigated can also be applied to a variety of queueing models that are close siblings of M/G/1: priority and breakdowns and ``vacations being examples.
- On Estimation in M/G/c/c Queues
- Performance Evaluation in a Queueing System M 2/G/1
- Performance analysis approximation in a queueing system of type \(M/G/1\)
- On the transient delays of M/G/1 queues
- Statistical inference for G/M/1 queueing system
- A generalized \(p\)-value approach to inference on the performance measures of an \(M/E_{k}/1\) queueing system
- scientific article; zbMATH DE number 5951459
- scientific article; zbMATH DE number 1359942
- Approximations for the delay probability in the \(M/G/s\) queue
- Optimal Prediction of Times and Queue Lengths in the M/G/1 Queue
- A Combinatorial Method in the Theory of Queues
- A subjective Bayesian approach to the theory of queues. I: Modeling
- A subjective Bayesian approach to the theory of queues. II: Inference and information in M/M/1 queues
- A Waiting Line Process of Markov Type
- An Empirical Investigation of the Transient Behavior of Stationary Queueing Systems
- Bootstrap methods for standard errors, confidence intervals, and other measures of statistical accuracy
- Bootstrap methods: another look at the jackknife
- Estimation in single server queues
- scientific article; zbMATH DE number 4096542 (Why is no real title available?)
- scientific article; zbMATH DE number 3793182 (Why is no real title available?)
- scientific article; zbMATH DE number 3488392 (Why is no real title available?)
- scientific article; zbMATH DE number 3558709 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- Large deviation results for time-dependent queue length distributions
- Markov chain models - rarity and exponentiality
- Some consequences of estimating parameters for the M/M/1 queue
- Statistical analysis of queueing systems
- System availability: Time dependence and statistical inference by (semi) non‐parametric methods
- The average virtual waiting time as a measure of performance
- Transient behavior of the M/M/1 queue via Laplace transforms
- Transient behavior of the M/M/1 queue: Starting at the origin
- Bayesian inference in Markovian queues
- Statistical inference for the GI/G/1 queue using diffusion approximation
- Performance Evaluation in a Queueing System M 2/G/1
- Optimal Prediction of Times and Queue Lengths in the M/G/1 Queue
- Hitting time in an M/G/1 queue
- The average virtual waiting time as a measure of performance
- Processor sharing: a survey of the mathematical theory
This page was built for publication: On inference concerning time-dependent queue performance: The M/G/1 example
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q914269)
