TY - JOUR
T1 - Scalable resource management for high-performance Web servers
AU - Hasegawa, Go
AU - Terai, Tatsuhiko
AU - Okamoto, Takuya
AU - Murata, Masayuki
PY - 2004/6
Y1 - 2004/6
N2 - Although many research efforts have been devoted to network congestion in the face of an increase in the Internet traffic, there is little recent discussion on performance improvements for endhosts. In this paper, we propose a new architecture, called scalable socket buffer tuning (SSBT), to provide high-performance and fair service for many TCP connections at Internet endhosts. SSBT has two major features. One is to reduce the number of memory accesses at the sender host by using some new system calls, called Simple Memory-copy Reduction (SMR) scheme. The other is equation-based automatic TCP buffer tuning (E-ATBT), where the sender host estimates 'expected' throughput of the TCP connections through a simple mathematical equation, and assigns a send socket buffer to them according to the estimated throughput. If the socket buffer is short, max-min fairness policy is used. We confirm the effectiveness of our proposed algorithm through both simulation technique and an experimental system. From the experimental results, we have found that our SSBT can achieve up to a 30% gain for Web server throughput, and a fair and effective usage of the sender socket buffer can be achieved.
AB - Although many research efforts have been devoted to network congestion in the face of an increase in the Internet traffic, there is little recent discussion on performance improvements for endhosts. In this paper, we propose a new architecture, called scalable socket buffer tuning (SSBT), to provide high-performance and fair service for many TCP connections at Internet endhosts. SSBT has two major features. One is to reduce the number of memory accesses at the sender host by using some new system calls, called Simple Memory-copy Reduction (SMR) scheme. The other is equation-based automatic TCP buffer tuning (E-ATBT), where the sender host estimates 'expected' throughput of the TCP connections through a simple mathematical equation, and assigns a send socket buffer to them according to the estimated throughput. If the socket buffer is short, max-min fairness policy is used. We confirm the effectiveness of our proposed algorithm through both simulation technique and an experimental system. From the experimental results, we have found that our SSBT can achieve up to a 30% gain for Web server throughput, and a fair and effective usage of the sender socket buffer can be achieved.
KW - Hypertext transfer protocol
KW - Resource management
KW - Socket buffer
KW - Transmission control protocol
KW - Web server
UR - http://www.scopus.com/inward/record.url?scp=3042628338&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=3042628338&partnerID=8YFLogxK
U2 - 10.1002/dac.650
DO - 10.1002/dac.650
M3 - Article
AN - SCOPUS:3042628338
SN - 1074-5351
VL - 17
SP - 389
EP - 406
JO - International Journal of Communication Systems
JF - International Journal of Communication Systems
IS - 5
ER -