Analysis and improvement of fairness between TCP Reno and Vegas for deployment of TCP Vegas to the Internet

According to past research, a TCP Vegas version is able to achieve higher throughput than TCP Tahoe and Reno versions, which are widely used in the current Internet. However we need to consider a migration path for TCP Vegas to be deployed in the Internet. In this paper, by focusing on the situation where TCP Reno and Vegas connections share the bottleneck link, we investigate the fairness between two versions. From the analysis and the simulation results, we find that the performance of TCP Vegas is much smaller than that of TCP Reno as opposed to an expectation on TCP Vegas. The RED algorithm improves the fairness to some degree, but there may still be an inevitable trade-off between fairness and throughput. Accordingly, we consider two approaches to improve the fairness. The first one is to modify the congestion control algorithm of TCP Vegas, and the other is to modify the RED algorithm to detect misbehaved connections and drop more packets from those connections. We use both of analysis and simulation experiment for evaluating the fairness, and validate the effectiveness of the proposed mechanisms.

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

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

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

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

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

[6]  Robert Tappan Morris,et al.  Dynamics of random early detection , 1997, SIGCOMM '97.

[7]  Matthew Mathis,et al.  Forward acknowledgement: refining TCP congestion control , 1996, SIGCOMM 1996.

[8]  T. V. Lakshman,et al.  SRED: stabilized RED , 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).

[9]  Matthew Mathis,et al.  Forward acknowledgement: refining TCP congestion control , 1996, SIGCOMM '96.

[10]  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).

[11]  R. Shreedhar,et al.  Efficient Fair Queuing Using Deficit Round - , 1997 .

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

[13]  Michael Perloff,et al.  Improvements to TCP performance in high-speed ATM networks , 1995, CACM.

[14]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.