Approximations to GPS: a bound

THEOREM: Scheduling algorithm A is work-conserving and chooses packets according to estimated GPS-completion time
==>

fi,Ak ? fi,GPSk + Lmax / r
(where r is the rate [bandwidth] of the server)

Previous slide

Next slide

Back to first slide

View graphic version