Assessing and improving TCP rate shaping over edge gateways

Computers installed with commercial/open-source software have been widely employed as organizational edge gateways to provide policy-based network management. Such gateways include firewalls for access control, and bandwidth managers for managing the narrow Internet access links. When managing the TCP traffic, pass-through TCP flows can introduce large buffer requirements, large latency, frequent buffer overflows, and unfairness among flows competing for the same queue. So, how to allocate the bandwidth for a TCP flow without the above drawbacks becomes an important issue. This study assesses and improves TCP rate shaping algorithms to solve the above problems through self-developed implementations in Linux, testbed emulations, live Internet measurements, computer simulations, modeling, and analysis. The widely deployed TCP rate control (TCR) approach is found to be more vulnerable to Internet packet losses and less compatible to some TCP sending operating systems. The proposed PostACK approach can preserve TCR's advantages while avoiding TCR's drawbacks. PostACK emulates per-flow queuing, but relocates the queuing of data to the queuing of ACKs in the reverse direction, hence minimizing the buffer requirement up to 96 percent. PostACK also has 10 percent goodput improvement against TCR under lossy WAN environments. A further scalable design of PostACK can scale up to 750Mbps while seamlessly cooperating with the link-sharing architecture. Experimental results can be reproduced through our open sources: 1) tcp-masq: a modified Linux kernel, 2) wan-emu: a testbed for conducting switched LAN-to-WAN or WAN-to-LAN experiments with RTT/loss/jitter emulations.

[1]  Hari Balakrishnan,et al.  Network Working Group , 1991 .

[2]  Ying-Dar Lin,et al.  A survey and measurement-based comparison of bandwidth management techniques , 2003, IEEE Communications Surveys & Tutorials.

[3]  Brian N. Bershad,et al.  Receiver based management of low bandwidth access links , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[5]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[6]  Vern Paxson,et al.  TCP Congestion Control , 1999, RFC.

[7]  Ying-Dar Lin,et al.  Building an integrated security gateway: Mechanisms, performance evaluations, implementations, and research issues , 2002, IEEE Communications Surveys & Tutorials.

[8]  Srinivasan Seshan,et al.  Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP , 2002, SIGCOMM '02.

[9]  K. K. Ramakrishnan,et al.  Explicit window adaptation: a method to enhance TCP performance , 2002, TNET.

[10]  Shivkumar Kalyanaraman,et al.  TCP rate control , 2000, CCRV.

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

[12]  Van Jacobson,et al.  Link-sharing and resource management models for packet networks , 1995, TNET.

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

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

[15]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

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

[17]  P. Narvaez,et al.  An acknowledgment bucket scheme for regulating TCP flow over ATM , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

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

[19]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM '96.

[20]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[21]  Scott Shenker,et al.  Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic , 1991, SIGCOMM '91.

[22]  Zheng Wang,et al.  An Architecture for Differentiated Services , 1998, RFC.

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

[24]  Amit Aggarwal,et al.  Understanding the performance of TCP pacing , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[25]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[26]  Eitan Altman,et al.  A stochastic model of TCP/IP with stationary random losses , 2000, SIGCOMM.