[KSCI] Korea Science Citation Index Service

Gallop-Vegas: An Enhanced Slow-Start Mechanism for TCP Vegas

Ho Cheng-Yuan (Department of Computer Science, National Chiao Tung University)
Chan Yi-Cheng (Department of Computer Science and Information Engineering, National Changhua University of Education)
Chen Yaw-Chung (Department of Computer Science, National Chiao Tung University)

Publication Information

Journal of Communications and Networks / v.8, no.3, 2006 , pp. 351-359 More about this Journal

Abstract

In this article, we present a new slow-start variant, which improves the throughput of transmission control protocol (TCP) Vegas. We call this new mechanism Gallop-Vegas because it quickly ramps up to the available bandwidth and reduces the burstiness during the slow-start phase. TCP is known to send bursts of packets during its slow-start phase due to the fast window increase and the ACK-clock based transmission. This phenomenon causes TCP Vegas to change from slow-start phase to congestion-avoidance phase too early in the large bandwidth-delay product (BDP) links. Therefore, in Gallop-Vegas, we increase the congestion window size with a rate between exponential growth and linear growth during slow-start phase. Our analysis, simulation results, and measurements on the Internet show that Gallop-Vegas significantly improves the performance of a connection, especially during the slow-start phase. Furthermore, it is implementation feasible because only sending part needs to be modified.

Keywords

Slow-start; transmission control protocol (TCP); TCP-Vegas;

Citations & Related Records

Times Cited By Web Of Science : 0 (Related Records In Web of Science)
Times Cited By SCOPUS : 0

Reference

1	D. Starobinski and M. Sidi, 'Stochastically bounded burstiness for communication networks,' IEEE Trans. Inform. Theory, vol. 46, pp. 206-212, Jan. 2000 DOI ScienceOn
2	T. Konstantopoulos and V. Anantharam, 'Optimal flow control schemes that regulate the burstiness of traffic,' IEEEIACM Trans. Networking, vol. 3, pp. 423-432, Aug. 1995 DOI ScienceOn
3	J. Stillwell, Mathematics and Its History, Springer-Verlag, New York, p. 55, 1989
4	G. Chatranon, M. A. Labrador, and S. Banerjee, 'A survey of TCP-friendly router-based AQM schemes,' ELSEVIER Computer Commun., vol. 27, no. 15,pp. 1424-1440, Sept. 2004 DOI ScienceOn
5	L. Brakrno and L. Peterson, 'TCP Vegas: End-to-end congestion avoidance on a global Internet,' IEEE J. Select. Areas Commun., vol. 13, no. 8, pp. 1465-1480, Oct. 1995 DOI ScienceOn
6	U. Hengartner, J. Bolliger, and T. Gross, 'TCP Vegas revisited,' in Proc. IEEE INFO COM 2000, Mar. 2000, pp. 1546-1555
7	S. Vanichpun and W. Feng, 'On the trransient behavior of TCP Vegas,' in Proc. IEEE ICCCN 2002, Miami, Florida, Oct. 2002, pp. 504-508
8	H. Wang, H. Xin, D. S. Reeves, and K. G. Shin, 'A simple refinement of slow-start of TCP congestion control,' in Proc. ISCC 2000,3-6 July 2000, pp. 98-105
9	H. Wang and C. Williamson, 'A New Scheme for TCP congestion control: Smooth-start and dynamic recovery,' in Proc. MASCOTS'98, Montreal, Canada, July 1998, pp. 69-75
10	Y. Nishida, 'Smooth slow-start: Refining TCP slow-start for largebandwidth with long-delay networks,' in Proc. LCN'98, Boston, Massachusetts, 11-14 Oct. 1998, pp. 52-60
11	R. Calinger, Classics of Mathematics, Moore Publishing, Oak Park, Illiinois, pp. 235-237, 1982