Performance estimation of M/D_K/1 queue under fair Sojourn protocol in heavy traffic

We study the performance of a M/DK/1 queue under Fair Sojourn Protocol (FSP). We use a Markov process with mixed real- and measure-valued states to characterize the queuing process of system and its related processor sharing queue. The infinitesimal generator of the Markov process is derived. Classifying customers according to their service time, using techniques in multiclass queuing system, and borrowing recently developed heavy traffic results for processor-sharing queues, we are able to derive approximations for average waiting time for the jobs. © 2009 Cambridge University Press.