A Simple Approximation to the Average Queue Size in the Time-Dependent M

by Kenneth Lloyd Rider


Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback16 pages $20.00 $16.00 20% Web Discount

The time-dependent equations for the M/M/1 queue can be reduced to a single equation for the expected queue size, but the equation is dependent on PO(t), the probability of no jobs in the system. An exact equation for the behavior of PO(t) under special conditions is derived and an approximation relating PO(t) to Q(t), the expected queue size at time t, is found for the case when the change in queue size is slow compared to the service rate. It is found that the approximation affords a significant improvement over the use of a steady-state approximation to the time-dependent queue and is simpler to use than the exact equations. 16 pp. Ref.

This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.