Light traffic approximations in many-server queues

Abstract

This paper complements two previous studies (Daley and Rolski (1984), (1991)) by investigating limit properties of the waiting time ink-server queues with renewal arrival process under ‘light traffic' conditions. Formulae for the limits of the probability of waiting and the waiting time moments are derived for the two approaches of dilation and thinning of the arrival process. Asmussen's (1991) approach to light traffic limits applies to the cases considered, of which the Poisson arrival process (i.e.M/G/k) is a special case and for which formulae are given.

Cite this work

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

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

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