The diffusion approximation of the Multiclass Processor Sharing queue
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.