A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A new look at transient versions of Little's law, and M/G/1 preemptive last-come-first-served queues
2010
Journal of Applied Probability
We take a new look at transient, or time-dependent Little laws for queueing systems. Through the use of Palm measures, we show that previous laws (see Bertsimas and Mourtzinou (1997)) can be generalized. Furthermore, within this framework, a new law can be derived as well, which gives higher-moment expressions for very general types of queueing system; in particular, the laws hold for systems that allow customers to overtake one another. What is especially novel about our approach is the use of
doi:10.1017/s0021900200006756
fatcat:et2ngeazbfffri6dgr7qdqp3da