Browse > Article

A Congestion Control Algorithm for the fairness Improvement of TCP Vegas  

오민철 (광운대학교 전자공학부)
송병훈 (광운대학교 전자공학)
정광수 (광운대학교 전자공학부)
Publication Information
Journal of KIISE:Information Networking / v.31, no.3, 2004 , pp. 269-279 More about this Journal
Abstract
The most important factor influencing the robustness of the Internet Is the end-to-end TCP congestion control. However, the congestion control scheme of TCP Reno, the most popular TCP version on the Internet, employs passive congestion indication. It makes worse the network congestion. Recently, Brakmo and Peterson have proposed a new version of TCP, which is named TCP Vegas, with a fundamentally different congestion control scheme from that of the Reno. Many studies indicate that the Vegas is able to achieve better throughput and higher stability than the Reno. But there are two unfairness problems in Vegas. These problems hinder the spread of the Vegas in current Internet. In this paper, in order to solve these unfairness problems, we propose a new congestion control algorithm called TCP PowerVegas. The existing Vegas depends mainly only on the rtt(round trip time), but the proposed PowerVegas use the new congestion control scheme combined the Information on the rtt with the information on the packet loss. Therefore the PowerVegas performs the congestion control more competitively than the Vegas. Thus, the PowerVegas is able to solve effectively these unfairness problems which the Vegas has experienced. To evaluate the proposed approach, we compare the performance among PowerVegas, Reno and Vegas under same network environment. Using simulation, the PowerVegas is able to achieve better throughput and higher stability than the Reno and is shown to achieve much better fairness than the existing Vegas.
Keywords
TCP Vegas; TCP Vegas; Congestion Control; fairness;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 C. Boutremans and J. Boudec, 'A Note on Fairness of TCP Vegas,' Proceeding of Broadband Communications, pp. 163-170, March 2000   DOI
2 The Network Simulator ns-2, http://www.isi.edu/nanam/ns/
3 K. Fall and S. Floyd, 'Simulation-based Comparisons of Tahoe, Reno, and SACK TCP,' Proceeding of ACM SIGCOMM '96, pp. 5-21, July 1996
4 L. Brakmo, S. O'Malley and L. Peterson, 'TCP Vegas: New Techniques for Congestion Detection and Avoidance,' Proceeding of ACM SIGCOMM '94, pp. 24-35, August 1994   DOI
5 J. Mo, R. La and J. Walrand, 'Analysis and Comparison of TCP Reno and TCP Vegas,' Proceeding of IEEE INFOCOM '99, pp. 1556-1563, March 1999   DOI
6 A. Vendictis and A. Baiocchi, 'Modeling a Mixed TCP Reno and TCP Vegas Scenario,' Proceeding of IFIP 2002, pp. 612-623, May 2002
7 T. Henderson and E. Sahouria, 'On Improving the Fairness of TCP Congestion Avoidance,' Proceeding of IEEE GLOBECOM '98, pp. 539-544, November 1998   DOI
8 V. Jacobson and M. Karels, 'Congestion Avoidance and Control,' Proceeding of ACM SIGCOMM '88, pp. 314-319, August 1988   DOI
9 V. Jacobson, 'Modified TCP Congestion Avoidance Algorithm,' LBNL Technical Report, April 1990
10 L. Brakmo and L. Peterson, 'TCP Vegas: End-to-end Congestion Avoidance on a Global Internet,' IEEE Communication, p. 1465-1480, October 1995   DOI   ScienceOn
11 T. Bonald, 'Comparison of TCP Reno and The Vegas: Efficiency and Farness,' Proceeding of ElsevierScience Publisher B. V., pp. 307-332, August 1999
12 O. Hellal and E. Altman, 'Analysis of TCP Vegas and TCP Reno,' Proceeding of ICC '97, pp. 495-499, June 1997   DOI
13 Y. Lai, 'Improving the Performance of TCP Vegas in a Heterogeneous Environment,' Proceeding of ICPADS 2001, pp. 581-587, June 2001   DOI
14 Y. Lai, 'Improving the Performance of TCP Vegas in a Heterogeneous Environment,' Proceeding of IEEE ICPADS 2001, pp. 581-587, June 2001   DOI
15 G. Hasegawa, M. Murata and H. Miyahara, 'Fairness and Stabillity of Congestion Control Mechanisms of TCP,' Proceeding of IEEE INFOCOM '99, pp. 1329-1336, March 1999