A Light Traffic Approximation for a Single-Server Queue

Daryl J. Daley · Tomasz Rolski

17 citations0/0 files storedMathematics of Operations Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Probability and Statistical Research Probability and Risk Models

Abstract

It is shown that in the GI/G/1 queue, with W(S, T) denoting a stationary waiting time random variable that is determined by the generic service and interarrival times S and T, [Formula: see text] whenever the right-hand side exceeds one. While equality need not necessarily hold when Pr{T > 0} = 1, sufficient conditions are given for the limit result to remain true.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 17 citations exist upstream.

References

1983The Single Server Queue 1983The Single Server Queue.1972Some inequalities for GI/M/n queues

Cited by

2003Idle period approximations and bounds for the GI/G/1 queue 2019The advantage of indices of dispersion in queueing approximations 1994Light traffic approximations in general stationary single-server queues 1992Light traffic for workload in queues

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.