Interoutput times in processor sharing queues with feedback
This paper studies the traffic flows in a processor sharing queue with Poisson input and feedback. The main results show that various flows in infinite server queues are non stationary Poisson processes and that a single server processor sharing queue with constant service requirements exhibits certain stochastic order relations. It should be noted, that equations 2.1 requires a term \(\phi\) (k)! in the denominator. This error is repeated on p. 368.
scientific article; zbMATH DE number 4080904