Problem 6 (20pts) Derive the expected throughput of the following TCP congestion control algorithm: The additive increment factor is -Multiplicative decrease factor , which means after loss, the windows size will change from w to (1- w. Please order the throughput for each flow. AlMD(R) means the swnd increaes a per each round trip time and the swad set to (1-b)W from W when the loss happens Flow1: AlMD(a-1,b-0.5), RTT 10ms, loss rate 106 Flow2: AIMD(a-2,b-0.2), RTT 100ms, loss rate 103 Flow3: AIMD(a-5b-0.8), RTT 300ms, loss rate 109 Flow4: AIMD(a-8,b-0.4), RTT 1000ms, loss rate 10 Flow5: AIMD(a-6b-0.5), RTT-100ms, loss rate 10 Problem 6 (20pts) Derive the expected throughput of the following TCP congestion control algorithm: The additive increment factor is -Multiplicative decrease factor , which means after loss, the windows size will change from w to (1- w. Please order the throughput for each flow. AlMD(R) means the swnd increaes a per each round trip time and the swad set to (1-b)W from W when the loss happens Flow1: AlMD(a-1,b-0.5), RTT 10ms, loss rate 106 Flow2: AIMD(a-2,b-0.2), RTT 100ms, loss rate 103 Flow3: AIMD(a-5b-0.8), RTT 300ms, loss rate 109 Flow4: AIMD(a-8,b-0.4), RTT 1000ms, loss rate 10 Flow5: AIMD(a-6b-0.5), RTT-100ms, loss rate 10