Light traffic equivalence in single-server queues (Q1201314)

The behaviour of the steady-state waiting time of the \(GI/G/1\) queue in light traffic is studied, resulting in rather deep insights. The analysis is based upon a light traffic limit theorem for random walks in a triangular array setting, which is proved at the outset. The special case of phase-type distributions is shown to allow more explicit and computationally tractable results.