This Article 
 Bibliographic References 
 Add to: 
Assessing and Improving TCP Rate Shaping over Edge Gateways
March 2004 (vol. 53 no. 3)
pp. 259-275

Abstract—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] H.Y. Wei and Y.D. Lin, A Measurement-Based Survey and Comparison of Bandwidth Management Techniques IEEE Comm. Surveys and Tutorials, to appear. tw/bandwidthBWSurvey.pdf , 2004.
[2] Y.D. Lin, H.Y. Wei, and S.T. Yu, Integration and Performance Evaluation of Security Gateways: Mechanisms, Implementations, and Research Issues IEEE Comm. Surveys and Tutorials, vol. 4, no. 1, Third Quarter 2002.
[3] S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss, An Architecture for Differentiated Services RFC 2475, Dec. 1998.
[4] S. Floyd and V. Jacobson, “Link-Sharing and Resource Management Models for Packet Networks,” IEEE Trans. Networking, vol. 3, no. 4, pp. 365-386, Aug. 1995.
[5] W.R. Stevens, TCP/IP Illustrated Volume 1 The Protocols, p. 289. Addison-Wesley, 1994.
[6] M. Allman, H. Balakrishnan, and S. Floyd, Enhancing TCP's Loss Recovery Using Limited Transmit RFC 3042, Jan. 2001.
[7] J. Mahdavi, Enabling High Performance Data Transfers on Hosts , 2003.
[8] S. Floyd and V. Jacobson, “Random Early Detection Gateways for Congestion Avoidance,” IEEE/ACM Trans. Networking, vol. 1, pp. 397-413, Aug. 1993.
[9] S. Karandikar, S. Kalyanaraman, P. Bagal, and B. Packer, TCP Rate Control ACM Computer Comm. Rev., vol. 30, no. 1, Jan. 2000.
[10] D. Lin and R. Morris, Dynamics of Random Early Detection Proc. ACM SIGCOMM '97, Sept. 1997.
[11] S. Floyd and K. Fall, Promoting the Use of End-to-End Congestion Control in the Internet IEEE/ACM Trans. Networking, vol. 7, no. 4, pp. 458-472, Aug. 1999.
[12] J. Padhye, V. Firoiu, D. Towsley, and J. Kurose, Modelling TCP Throughput: A Simple Model and Its Empirical Validation Proc. ACM SIGCOMM '98, Sept. 1998,
[13] E. Altman, K. Avrachenkov, and C. Barakat, A Stochastic Model of TCP/IP with Stationary Random Losses Proc. ACM SIGCOMM '00, Aug. 2000.
[14] A. Akella, S. Seshan, R. Karp, S. Shenker, and C. Papadimitriou, Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP Proc. ACM SIGCOMM '02, Aug. 2002.
[15] K. Fall and S. Floyd, Simulation-Based Comparisons of Tahoe, Reno, and SACK TCP ACM Computer Comm. Rev., vol. 26, no. 3, pp. 5-21, July 1996.
[16] L.S. Brakmo, S.W. O'Malley, and L.L. Peterson, TCP Vegas: New Techniques for Congestion Detection and Avoidance Proc. ACM SIGCOMM '94, Sept. 1994.
[17] M. Mathis and J. Mahdavi, Forward Acknowledgement: Refining TCP Congestion Control Proc. ACM SIGCOMM '96, Aug. 1996.
[18] M. Allman, V. Paxson, and W. Stevens, TCP Congestion Control RFC 2581, Apr. 1999.
[19] D. Stiliadis and A. Varma, Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms IEEE/ACM Trans. Networking, vol. 6, pp. 675-689, Oct. 1998.
[20] J.C.R. Bennett and H. Zhang, Hierarchical Packet Fair Queuing Algorithms Proc. ACM SIGCOMM '96, Aug. 1996.
[21] L. Kalampoukas, A. Varma, and K.K. Ramakrishnan, Explicit Window Adaptation: A Method to Enhance TCP Performance Proc. IEEE INFOCOM '98, Apr. 1998.
[22] N.T. Spring, M. Chesire, M. Berryman, and V. Sahasranaman, Receiver Based Management of Low Bandwidth Access Links Proc. INFOCOM '00, Apr. 2000.
[23] L. Zhang, S. Shenker, and D.D. Clark, Observations on the Dynamics of a Congestion Control Algorithm: The Effects of Two-Way Traffic Proc. ACM SIGCOMM '91, Sept. 1991.
[24] P. Narváez and K.Y. Siu, An Acknowledge Bucket Scheme for Regulating TCP Flow over ATM Proc. IEEE GLOBECOM '97, Nov. 1997.
[25] A. Aggarwal, S. Savage, and T. Anderson, Understanding the Performance of TCP Pacing Proc. INFOCOM '00, Apr. 2000.
[26] Packeteer, Inc.,http:/, 2003.
[27] A. Demers, S. Keshav, and S. Shenker, Analysis and Simulation of a Fair Queuing Algorithm Proc. ACM SIGCOMM '89, Sept. 1989.
[28] Open Source: tcp-masq and wan-emu Linux Kernel Patches /,, 2002.

Index Terms:
Bandwidth management, TCP, rate enforcement, window-sizing, ACK-pacing, scheduling, queuing, packet scheduler, testbed.
Huan-Yun Wei, Shih-Chiang Tsao, Ying-Dar Lin, "Assessing and Improving TCP Rate Shaping over Edge Gateways," IEEE Transactions on Computers, vol. 53, no. 3, pp. 259-275, March 2004, doi:10.1109/TC.2004.1261834
Usage of this product signifies your acceptance of the Terms of Use.