Performance of Paced and Non-Paced Transmission Control Algorithms in Small Buffered Networks

Famous rule-of-thumb states that a buffer sized at B = RTT × BW, where RTT is the average round trip time and BW is the bandwidth of output link is necessary in order to achieve high utilization with TCP flows. However, as the link speeds continue increasing with technological advances, this buffer requirement starts becoming an important cost factor on routers of electronic networks. On the other hand, bursty nature of TCP limits further decreasing the buffer requirements, because it brings a very high packet drop rate in small buffered networks. In this paper, we evaluate several transmission control algorithms in small buffered networks. The algorithms include TCP Reno, TCP NewReno, Highspeed TCP with SACK, and ∗Corresponding Author. Phone [phone]. FAX [phone]. †O. Alparslan is supported by Ministry of Education, Culture, Sports, Science and Technology, Japan (Monbukagakusho) 

• Type: Conference
• Year: 2006
• Where: ISCC
• Authors: Onur Alparslan, Shin'ichi Arakawa, Masayuki Murata
• Keywords: Algorithms Include Tcp, Buffer Requirements, Communications, ISCC 2006, Small Buffered Networks