M/G/ system with non-preemptive priorities: background r classes of customers class 1 is highest priority, class r is lowest Poisson arrivals for each class k, rate k General service times, Sk, for each class fs(s); ElSa]=1/uKs E[SK2 FIFO service for each class Infinite queue capacity for each class Define: Pk Assume for now that: P=P1+p2+. t pr<1M/G/1 system with non-preemptive priorities: background • r classes of customers; class 1 is highest priority, class r is lowest • Poisson arrivals for each class k; rate lk • General service times, Sk , for each class; fSk(s); E[Sk ]=1/mk ; E[Sk 2] • FIFO service for each class • Infinite queue capacity for each class • Define: rk = lk /mk • Assume for now that: r = r1 + r2 +….+ rr <1