Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A central-limit-theorem version ofL=?w

5 references·14 citing·39 second hop

FromToDepth

this work references cited by second hop

References

1961A Proof for the Queuing Formula: L = λ W2,777 cited
1986Comparison Methods for Queues and Other Stochastic Models.938 cited
1984Comparison Methods for Queues and Other Stochastic Models720 cited
1970Multiple channel queues in heavy traffic. II: sequences, networks, and batches281 cited
1974Technical Note—A Last Word on L = λW179 cited

Cited by

1993Diffusion approximations for open queueing networks with service interruptions48 cited
1989Sample-path analysis of processes with imbedded point processes46 cited
1987Sufficient conditions for functional-limit-theorem versions ofL = ?W45 cited
2021A survey of parameter and state estimation in queues41 cited
2013Statistical Analysis with Little's Law35 cited
1988A Light-Traffic Approximation for Single-Class Departure Processes from Multi-Class Queues33 cited
1994Fluid limits and diffusion approximations for networks of multi-server queues in heavy traffic28 cited
1994Unstable Asymptotics for Nonstationary Queues27 cited
1990Chapter 10 Queueing theory22 cited
1989A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networks

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

20 cited

1988Estimating Average Production Intervals Using Inventory Measurements: Little's Law for Partially Observable Processes19 cited

1993Estimating Customer and Time Averages19 cited

1989An extremal property of the fifo discipline via an ordinal version of14 cited

2014A law of iterated logarithm for multiclass queues with preemptive priority service discipline13 cited