The diffusion approximation of the Multiclass Processor Sharing queue
This paper considers a multiclass processor-sharing queue with feedback. Jobs arrive according to renewal processes, and service times follow general distributions. Upon service completion, jobs may either depart the system or re-enter as a different class according to a probabilistic, Jackson-like routing mechanism. Under heavy-traffic conditions, we establish a diffusion approximation for a measure-valued process tracking the residual service times of jobs.
math.PR↗