Little's law in distributional form
Since Little's Law first appeared in 1961, its simplicity and importance have established it as a basic tool of queueing theory. Little's Law relates the average number of customers in a system, N, with the average time in the system, T, under very broad conditions. For example, Keilson and Servi (1988) have demonstrated that for many systems, the relationship between the queue length and the time in the system can be characterized beyond just their average value.
an ordinary single-server queue,
a single-server queue with one or more classes of priority which processes each class according to a preemptive-resume, preemptive-repeat, or nonpreemptive discipline,
a vacation model system, where the server takes one or more “vacations” when the queue is depleted,
a polling system, where a...
- Abramowitz, M. and Stegun, I.A. (1972). Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. National Bureau of Standards, U.S. Government Printing Office. 824–825. Google Scholar
- Bertsimas, D. and Mourtzinou, G. (1997). “Transient laws of non-stationary queueing systems and their applications.” Queueing Systems, 25, 115–155.Google Scholar
- Keilson, J. and Servi, L.D. (1988). “A distributional form of Little's Law,” Operation Research Letters, 7, 223–227.Google Scholar
- Keilson, J. and Servi, L.D. (1990). “The distributional form of Little's Law and the Fuhrmann-Cooper decomposition.” Operations Research Letters, 9, 239–247.Google Scholar
- Little, J. (1961). “A proof of the theorem L = λ W.” Operations Research, 8, 383–387.Google Scholar
- Szczotka, W. (1992). “A distributional form of Little's law in heavy traffic.” Annals Probability, 20, 790–800.Google Scholar
- Takahashi, Y. and Miyazawa, M. (1994). “Relationship between queue-length and waiting time distributions in a priority queue with batch arrivals.” Jl. Operations Research Society Japan, 37, 48–63.Google Scholar