Design of TCP Congestion Control Techniques by Router-Assisted Approach

With tremendous growth of Internet traffic, to utilize network resources efficiently is essential to a successful congestion control protocol. Transmission Control Protocol (TCP) is a widely used end-to-end transport protocol across the Internet. It has several enhancing versions such as TCP Reno and TCP Vegas, which intend to improve the drawbacks of the initial version of TCP. Most congestion control techniques use trial-and-error based flow control to handle network congestion. In this paper, we propose a new method named TCP Muzha that requires routers to feedback their status to sender. Based on this information, sender is able to adjust the data rate dynamically. We also propose a multi-level data rate adjustment method to help dissolving congestion. Finally we use NS2 simulator to evaluate the performance of our approach. Keyword: TCP, congestion control, router.

[1]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[2]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[3]  Wolfgang Effelsberg,et al.  The Fairness Challenge in Computer Networks , 2000, QofIS.

[4]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[5]  Jon Postel,et al.  Internet Protocol , 1981, RFC.

[6]  W. Richard Stevens,et al.  TCP/IP Illustrated, Volume 1: The Protocols , 1994 .

[7]  David E. Culler,et al.  A blueprint for introducing disruptive technology into the Internet , 2003, CCRV.

[8]  Yi-Cheng Chan,et al.  RoVegas: a router-based congestion avoidance mechanism for TCP Vegas , 2004, Comput. Commun..

[9]  Eitan Altman,et al.  Fairness analysis of TCP/IP , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[10]  Sally Floyd,et al.  Simulation-based comparisons of Tahoe, Reno and SACK TCP , 1996, CCRV.

[11]  Mark Crovella,et al.  Measuring Bottleneck Link Speed in Packet-Switched Networks , 1996, Perform. Evaluation.

[12]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[13]  Sally Floyd,et al.  TCP Selective Acknowledgement Options , 1996 .

[14]  Andrew S. Tanenbaum,et al.  Computer Networks , 1981 .

[15]  Zhen Liu,et al.  Evaluation of TCP Vegas: emulation and experiment , 1995, SIGCOMM '95.

[16]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[17]  Jon Postel,et al.  Transmission Control Protocol , 1981, RFC.

[18]  Vern Paxson,et al.  End-to-end Internet packet dynamics , 1997, SIGCOMM '97.

[19]  Masayuki Murata,et al.  Survey on Fairness Issues in TCP Congestion Control Mechanisms , 2001 .

[20]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[21]  Bruce S. Davie,et al.  Computer Networks: A Systems Approach, 3rd Edition , 2003 .

[22]  Larry Peterson,et al.  TCP Vegas: new techniques for congestion detection and avoidance , 1994, SIGCOMM 1994.

[23]  W. Richard Stevens,et al.  TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms , 1997, RFC.

[24]  Chunming Qiao,et al.  Advances in internet congestion control , 2003, IEEE Communications Surveys & Tutorials.

[25]  David D. Clark,et al.  Window and Acknowledgement Strategy in TCP , 1982, RFC.

[26]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[27]  Walid Dabbous,et al.  On TCP performance in a heterogeneous network: a survey , 2000, IEEE Commun. Mag..