End to End Bandwidth Estimation in TCP to improve Wireless端到端的带宽估计的TCP改进无线.pptVIP

End to End Bandwidth Estimation in TCP to improve Wireless Link Utilization S. Mascolo, A.Grieco, G.Pau, M.Gerla, C.Casetti Presented by Abhijit Pandey Outline Introduction TCP Westwood overview Performance Evaluation in Wireless scenarios Internet Measurements Conclusion Introduction TCP Tahoe - Slow-start and Congestion avoidance TCP Reno -Fast Retransmission and Fast Recovery Problems In Wireless lossy links, the sporadic losses are not due to congestion thus it leads to unnecessary window and transmission rate reduction Common TCP terms Slow Start Exponential increase from cwnd =1, increase in window for every Ack received. Fast Retransmission Retransmission sooner then timeout after 3 acks Congestion/ Slow Start Threshold - Window resulting from multiplicative decrease Faster Recovery – Avoids slow start and starts from the congestion window at half the value. Linear increase Congestion avoidance - Linear increase, Increase in window for every RTT time. TCP Westwood Sender side only modification of TCP Reno Congestion control that exploits end to end bandwidth estimation. The bandwidth is estimated by low pass filtering the rate of returning acks. The bandwidth is used to compute congestion window and slow start threshold. TCP Westwood Overview Slow Start and Congestion window aware of Bandwidth at time of congestion The increase after congestion is additive but decrease Adaptive (AIAD) as compared to AIMD (Additive Increase Multiplicative decrease) of Reno TCPW implementation Sender side Bandwidth Estimation by measuring and low pass filtering the rate of returning acks When 3 DUPACKS are received ssthresh=(Bandwidth*RTT)/seg_size cwnd =ssthresh When a coarse timeout expires ssthresh =(B*RTT)/seg_size cwnd =1 When acks are successfully received TCPW increases cwnd according to Reno’s congestion control algorithm TCPW Advantage over Reno In case of sudden increase in bottleneck load, reduction can be more drastic then a redu