<i>GI</i>/<i>G</i>/1 processor sharing queue in heavy traffic

Abstract

Consider GI/G/ 1 processor sharing queues with traffic intensity tending to 1. Using the theory of random measures and the theory of branching processes we investigate the limiting behaviour of the queue length, sojourn time and random measures describing attained and residual processing times of customers present.