S.F. Yashkov

On Random Order of Service and Processor Sharing

We show that the stationary sojourn time distribution in the M/M/1 (egalitarian) processor sharing queue is closely related to the stationary waiting time distribution in the same queue under the random order of service. This enables us to obtain new results concerning tail behavior of the sojourn time in the processor sharing queue, in particular, for the normalized maxima of the sojourn times.