Estimating queue length distributions for queues with random arrivals

  • Authors:
  • Daniel S. Myers;Mary K. Vernon

  • Affiliations:
  • University of Wisconsin-Madison;University of Wisconsin-Madison

  • Venue:
  • ACM SIGMETRICS Performance Evaluation Review
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work develops an accurate and efficient two-moment approximation for the queue length distribution in theM/G/1 queue. Queue length distributions can provide insight into the impact of system design changes that go beyond simple averages, but conventional queueing theory lacks efficient techniques for estimating the long-run queue length distribution when service times are not exponential. The approximate queue lengths depend on only the first and second moments of the service time rather than the full service time distribution, resulting in a model that is applicable to a wide variety of systems. Validation results show that the new approximation is highly accurate for light-tailed service time distributions. Work in progress includes developing accurate approximations for multi-server queues and heavy-tailed service distributions.