Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

The advantage of indices of dispersion in queueing approximations

13 references·2 citing·45 second hop

FromToDepth

this work references cited by second hop

References

1983The Queueing Network Analyzer1,034 cited
1982Approximating a Point Process by a Renewal Process, I: Two Basic Methods544 cited
1984Open Queueing Networks in Heavy Traffic449 cited
1962Some Inequalities for the Queue GI/G/1222 cited
1971On the relation between customer and time averages in queues128 cited
1990The QNET method for two-moment analysis of open queueing networks109 cited
1984On Approximations for Queues, III: Mixtures of Exponential Distributions81 cited
1989Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queue79 cited
2015Robust Queueing Theory77 cited
1990The heavy-traffic bottleneck phenomenon in open queueing networks51 cited
1994Sequential Bottleneck Decomposition: An Approximation Method for Generalized Jackson Networks33 cited
2017Using Robust Queueing to Expose the Impact of Dependence in Single-Server Queues31 cited
1984A Light Traffic Approximation for a Single-Server Queue17 cited

Cited by

2023Supervised ML for Solving the GI/GI/1 Queue11 cited
2021Queues with path-dependent arrival processes

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

11 cited