A Novel ECN-Based Congestion Control and Avoidance Algorithm with Forecasting and Verifying
The congestion control and avoidance algorithms can be divided into source and link algorithms. The source algorithms are based on ’pipe’ model; which includes TCP Tahoe, TCP Reno, TCP NewReno, SACK and TCP Vegas. In this paper, we present a novel congestion control source algorithm-FAV(Forecast And Verify), which measures packets delay to forecast whether there will be congestion in network, and uses ECN to verify whether the forecast is precise or not. Experiments are performed by ns2 to compare FAV with TCP Reno and TCP Vegas, and the results imply that FAV algorithm can decrease loss rate and link delay efficiently, and keep link utilization high. We think FAV can control the congestion better than other source algorithms.
Unable to display preview. Download preview PDF.
- 1.Jacobson, V.: Congestion Avoidance and Control. In: Proc. ACM SIGCOMM 1988, pp. 314–329 (1988)Google Scholar
- 2.Jacobson, V.: Modified TCP Congestion Avoidance Algorithm, Message to end2endinterest mailing list (April 1990)Google Scholar
- 3.Ramakrishnan, K.: The Addition of Explicit Congestion Notification (ECN) to IP, RFC 3168 (September 2001) Google Scholar
- 4.Network Simulator - ns (version 2), http://www.isi.edu/nsnam/ns/
- 8.Brakmo, L., O’Malley, S., Peterson, L.: TCP Vegas: New techniques for congestion detection and avoidance. In: Proceedings of the ACM SIGCOMM 1994, August 1994, pp. 24–35 (1994)Google Scholar