NSLect01.pptVIP

The RED Mechanism RED: Marking/dropping based on average queue length x (t) tmin tmax pmax 1 2tmax Marking probability p Average queue length x t - - q (t) - x (t) x (t): smoothed, time averaged q (t) Modeling RED: A Single Congested Router TCP flow i, prop. delay Ai AQM router C, p One bottlenecked AQM router service capacity {C (packets/sec) } queue length q(t) drop prob. p(t) N TCP flows window sizes Wi (t) round trip time Ri (t) = Ai+q (t)/C throughputs Bi (t) = Wi (t)/Ri (t) System of Differential Equations Window Size: Additive increase Loss arrival rate Mult.