1. Zhengbin Bian (zbian@cs.sfu.ca) and Hui (Hilary) Zhang (hzhang@sfu.ca)

Evaluation of different TCP congestion control algorithms by ns-2:

TCP congestion control was introduced into the Internet in the late 1980's by Van Jacobson. Immediately preceding this time, the Internet was suffering from congestion collapse. The algorithm for TCP congestion control is the main reason we can use the Internet successfully today despite resource bottlenecks and largely unpredictable user access patterns.

TCP congestion control lies in Slow-Start, Additive Increase Multiplicative Decrease (AIMD), Fast Retransmit and Fast Recovery. There are different implementations among which are Tahoe TCP, Reno TCP, New Reno TCP, SACK TCP and and TCP Vegus. In the project, we will evaluate the performance regarding throughput, delay, and loss. Various parameters will be used.

Simulation will be done using Network Simulator (NS-2)

References:

[1] Kevin Fall, Sally Floyd, Simulation-based comparisons of Tahoe, Reno and SACK TCP, ACM SIGCOMM Computer Communication Review, v.26 n.3, p.5-21, July 1996. http://www.sfu.ca/~zbian/courses/cmpt885/fall96simulationbased.pdf

[2] S. Floyd, Congestion Control Principles, RFC2914, September 2000, http://www.ietf.org/rfc/rfc2914.txt

[3] S. Floyd, T. Henderson, The NewReno Modification to TCP's Fast Recovery Algorithm, RFC2582,April 1999, http://www.ietf.org/rfc/rfc2582.txt

[4] S. Floyd, J. Mahdavi, M. Mathis, M. Podolsky, An Extension to the Selective Acknowledgement (SACK) Option for TCP, RFC2883, July 2000, http://www.ietf.org/rfc/rfc2883.txt

[5] V. Jacobson, Congestion avoidance and control, ACM SIGCOMM Computer Communication Review, v.18 n.4, p.314-329, August 1988. http://www.sfu.ca/~zbian/courses/cmpt885/congavoid.ps

[6] Jeonghoon Mo, Richard J. La, Venkat Anantharam, and Jean Walrand, Analysis and Comparison of TCP Reno and Vegas. http://www.sfu.ca/~zbian/courses/cmpt885/mo-tcp-reno-vegus.pdf