An Efficient TCP Buffer Tuning Technique Based on Packet Loss Ratio (TBT-PLR)
نویسندگان
چکیده
The existing TCP (Transmission Control Protocol) is known to be unsuitable for a network with the characteristics of high BDP (Bandwidth-Delay Product) because of the fixed small or large buffer size at the TCP sender and receiver. Thus, some trial cases of adjusting the buffer sizes automatically with respect to network condition have been proposed to improve the end-to-end TCP throughput. ATBT (Automatic TCP Buffer Tuning) attempts to assure the buffer size of TCP sender according to its current Congestion Window size (CWND), but the ATBT assumes that the buffer size of TCP receiver is maximum value that operating system defines. In DRS(Dynamic Right Sizing), by estimating the TCP arrival data of two times the amount TCP data received previously, the TCP receiver simply reserves the buffer size for the next arrival, accordingly. However, we do not need to reserve exactly two times of buffer size because of the possibility of TCP segment loss. We propose an efficient TCP buffer Tuning technique (called TBT-PLR : TCP Buffer Tuning technique based on packet loss ratio) since we adopt the ATBT mechanism and the TBTPLR mechanism for the TCP sender and the TCP receiver, respectively. For the purpose of testing the actual TCP performance, we implemented our TBT-PLR by modifying the linux kernel version 2.4.18 and evaluated the TCP performance by comparing TBTPLR with the TCP schemes of the fixed buffer size. As a result, more balanced usage among TCP connections was obtained.
منابع مشابه
Estimates on the packet loss ratio via queue tail probabilities
In this paper we consider the connection between the packet loss ratio (PLR) in a switch with a finite buffer of size L and the tail distribution of the corresponding infinite buffer queue Q. In the literature the PLR is often approximated with the tail probability P(Q > L), and in practice the latter is often a good conservative estimate on the PLR. Therefore, efforts have mainly focused on fi...
متن کاملRED Behavior with Different Packet Sizes
We consider the adaptation of random early detection (RED) as a buffer management algorithm for TCP traffic in Internet gateways where different maximum transfer units (MTUs) are used. We studied the two RED variants described in [4] and point out a weakness in both. The first variant where the drop probability is independent from the packet size discriminates connections with smaller MTUs. The...
متن کاملDynamic Adjustment of TCP Window Sizes
The original design of TCP failed to support reasonable performance over networks with large bandwidths and high round-trip times. Subsequent work on TCP has enabled the use of larger flow-control windows, yet the use of these options is still relatively rare, because manual tuning has been required. Other work has developed means for avoiding this manual tuning step, but those solutions lack g...
متن کاملTCP WestwoodVT: A Novel Technique for Discriminating the Cause of Packet Loss in Wireless Networks
Conventional TCP in wireless environment cannot differentiate packet losses caused by network congestion from those caused by wireless link errors, thus, resulting in severe performance degradation. Accordingly, efficient operation of TCP in wireless networks is a critical issue in the context of differentiation between packet loss. Towards this issue, we proposes a novel technique, WestwoodVT ...
متن کاملOn Parameter Tuning of Data Transfer Protocol GridFTP for Wide-Area Networks
In wide-area Grid computing, geographically distributed computational resources are connected for enabling efficient and large-scale scientific/engineering computations. In the wide-area Grid computing, a data transfer protocol called GridFTP has been commonly used for large file transfers. GridFTP has the following features for solving problems of the existing TCP. First, for accelerating the ...
متن کامل