This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Dynamic Approach for Efficient TCP Buffer Allocation
March 2002 (vol. 51 no. 3)
pp. 303-312

The paper proposes local and global optimization schemes for efficient TCP buffer allocation in an HTTP server. The proposed local optimization scheme dynamically adjusts the TCP send-buffer size to the connection and server characteristics. The global optimization scheme divides a certain amount of buffer space among all active TCP connections. These schemes are of increasing importance due to the large scale of TCP connection characteristics. The schemes are compared to the static allocation policy employed by a typical HTTP server and shown to achieve considerable improvement to server performance and better utilization of its resources. The schemes require only minor code changes and only at the server.

[1] Apache HTTP server project,http:/www.apache.org, 1993.
[2] L.S. Brakmo and L.L. Peterson, “Performance Problems in BSD4.4 TCP,” Computer Comm. Rev., vol. 25, no. 5, pp. 69-86, Oct. 1995.
[3] L.S. Brakmo and L.L. Peterson, TCP Vegas: End-to-End Congestion Avoidance on a Global Internet IEEE J. Selected Areas in Comm., vol. 13, no. 8, pp. 1465-1480, Oct. 1995.
[4] A. Cohen and R. Cohen, “A Dynamic Approach for Efficient TCP Buffer Allocation,” Proc. Seventh Int'l Conf. Computer Comm. and Networks (ICCCN), pp. 817-824, Oct. 1998. Also, Technical Report LCCN9805, Dept. of Computer Science, Technion, Aug. 1998.
[5] D.A. Patterson, G. Gibson, and R.H. Katz, “A Case for Redundant Arrays of Inexpensive Disks (RAID),” Proc. ACM SIGMOD Conf., pp. 109–116, 1988.
[6] S. Floyd, “TCP and Explicit Congestion Notification,” ACM Computer Comm. Rev., vol. 24, no. 5, Oct. 1994.
[7] J. Mahdavi, J. Semke, and M. Mathis, “Automatic TCP Buffer Tuning,” Computer Comm. Rev., vol. 28, no. 4, Oct. 1998.
[8] V. Jacobson, R.T. Braden, and D.A. Borman, “TCP Extensions for High Performance,” Technical Report RFC 1323, May 1992.
[9] R. Jain, D. Chiu, and W. Hawe, “A Quantative Measure of Fairness and Discrimination for Resource Allocation in Shared Computer Systems,” Technical Report TR-301, DEC Research Report, Sept. 1984.
[10] S. McCanne and S. Floyd, “NS Network Simulator,” http://www-nrg.ee.lbl.govns, 1995.
[11] G.A. Gibson, P.M. Chen, E.K. Lee, and R.H. Katz, “RAID: High-Performance, Reliable Secondary Storage,” Technical Report UCB/CSD-93-778, Univ. of California at Berkeley, 1993.
[12] J. Semke, “Implementation Issues of the Autotuning Fair Share Algorithm,” Technical Report CMU-PSC-TR-2000-0002, Pittsburgh Supercomputing Center, May 2000.
[13] G. Wright and R. Stevens, TCP/IP Illustrated, vol. 2, chap. 15-16. Addison Wesley, 1995.

Index Terms:
HTTP, server performance, TCP send-buffer
Citation:
A. Cohen, R. Cohen, "A Dynamic Approach for Efficient TCP Buffer Allocation," IEEE Transactions on Computers, vol. 51, no. 3, pp. 303-312, March 2002, doi:10.1109/12.990128
Usage of this product signifies your acceptance of the Terms of Use.