Queues with superposition arrival processes in heavy traffic (Q1070672)

A multiserver queue with general service time distributions, where the input process is a superposition of n independent, identically distributed stationary renewal processes each with rate \(n^{-1}\) is investigated. Some problems with approximations when \(n\to \infty\) and the traffic intensity increases to 1 are sketched, and suitable limit theorems are proved which give partial answers to questions about heavy traffic approximations.