Performance improvement of congestion avoidance mechanism for TCP Vegas

In this paper, we propose a router-based congestion avoidance mechanism (RoVegas) for TCP Vegas. TCP Vegas detects network congestion in the early stage and successfully prevents periodic packet loss that usually occurs in TCP Reno. It has been demonstrated that TCP Vegas outperforms TCP Reno in many aspects. However, TCP Vegas suffers several problems that inhere in its congestion avoidance mechanism, these include issues of rerouting, persistent congestion, fairness, and network asymmetry. By performing the proposed scheme in routers along the round-trip path, RoVegas can solve the problems of rerouting and persistent congestion, enhance the fairness among the competitive connections, and improve the throughput when congestion occurs on the backward path. Through the results of both analysis and simulation, we demonstrate the effectiveness of RoVegas.

[1]  Jean C. Walrand,et al.  Analysis and comparison of TCP Reno and Vegas , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[3]  Janey C. Hoe,et al.  Start-up dynamics of TCP's congestion control and avoidance schemes , 1995 .

[4]  J.-Y. Le Boudec,et al.  A note on the fairness of TCP Vegas , 2000, 2000 International Zurich Seminar on Broadband Communications. Accessing, Transmission, Networking. Proceedings (Cat. No.00TH8475).

[5]  T. V. Lakshman,et al.  Window-based error recovery and flow control with a slow acknowledgement channel: a study of TCP/IP performance , 1997, Proceedings of INFOCOM '97.

[6]  Andras Veres,et al.  The chaotic nature of TCP congestion control , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[7]  Jürgen Falb,et al.  The Internet Protocol , 2005, The Industrial Information Technology Handbook.

[8]  Hossam Afifi,et al.  Improving congestion avoidance algorithms for asymmetric networks , 1997, Proceedings of ICC'97 - International Conference on Communications.

[9]  Masayuki Murata,et al.  Fairness and stability of congestion control mechanisms of TCP , 2000, Telecommun. Syst..

[10]  Soung Chang Liew,et al.  Performance degradation of TCP Vegas in asymmetric networks and its remedies , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[11]  Masayuki Murata,et al.  Fairness and stability of congestion control mechanisms of TCP , 1998, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

[13]  Soung Chang Liew,et al.  A remedy for performance degradation of TCP Vegas in asymmetric networks , 2003, IEEE Communications Letters.

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

[15]  József Bíró,et al.  On the proportional fairness of TCP Vegas , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[16]  Wu-chun Feng,et al.  The Failure of TCP in High-Performance Computational Grids , 2000, ACM/IEEE SC 2000 Conference (SC'00).