Study on the Effectiveness of the TCP Pacing Mechanism

The key idea proposed in this paper is to evaluate the effectiveness of TCP pacing mechanism minimizing the buffer requirements by routers. Based on references related to TFRC, buffer size needed in the bottleneck link, and analysis of the queue length in the router, the assumption that the router just needs less packets as buffer size, if the TCP traffic was paced than regularly TCP traffic in the bottleneck link shared by TCP and TFRC was made. Analysis of the queue length in the router was made. Simulation results show that the router can save at least 50% buffer size in the bottleneck link shared by pacing-based TCP and TFRC than in the bottleneck link shared by regular Reno TCP and TFRC, and when the utilization of the bottleneck reaches 90%, the loss rate hardly changes. The experiments are performed in both over-provisioned and under-provisioned network situations.

[1]  Guido Appenzeller,et al.  Sizing router buffers , 2004, SIGCOMM '04.

[2]  Mark Handley,et al.  RFC 5348: TCP Friendly Rate Control (TFRC): Protocol Specification , 2008 .

[3]  Cheng Song,et al.  High performance TCP in ANSNET , 1994, CCRV.

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

[5]  Jörg Widmer,et al.  TCP Friendly Rate Control (TFRC): Protocol Specification , 2003, RFC.

[6]  Tim Roughgarden,et al.  Routers with Very Small Buffers , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[7]  Mark Handley,et al.  Equation-Based Congestion Control for Unicast Applications: the Extended Version , 2000 .

[8]  Donald F. Towsley,et al.  Modeling TCP Reno performance: a simple model and its empirical validation , 2000, TNET.

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