Recap: A bound
THEOREM: Scheduling algorithm A is work-conserving and chooses (arrived) packets according to estimated GPS-completion time
==>
fi,Ak ? fi,GPSk + Lmax / r
(where r is the rate [bandwidth] of the server)
PGPS/ WFQ performance bounds:
fi,WFQk ? fi,GPSk + Lmax / r