S.F.Yashkov and  A.S.Yashkova

A Note on a Heavy Traffic Limit Theorem for the M/D/1—FBPS Queue

In this short article we give a simple proof of the heavy traffic limit theorem for the sojourn time distribution, suitably scaled, in the M/D/1 queueing system under the foreground–background processor sharing (FBPS) discipline. The FBPS discipline gives the preemptive–resume priority in service to those jobs that have received the least amount of service so far.