TY - JOUR
T1 - WINTRAC
T2 - A TCP window adjustment scheme for bandwidth management
AU - Aweya, James
AU - Ouellette, Michel
AU - Montuno, Delfin Y.
AU - Yao, Zhonghui
PY - 2001/9
Y1 - 2001/9
N2 - In TCP, congestion control as well as error recovery are implemented by a sliding window. The dynamics of TCP specifically, a mismatch between the TCP window and the bandwidth-delay product of the network can sometimes cause the network switches or routers to accumulate large queues, resulting in buffer overflows, reduced throughput, unfairness and underutilization. It is generally accepted that there is a limit to how much control can be accomplished from the congestion control mechanisms in the end systems. Some mechanisms are needed in the intermediate network elements to complement the endpoint congestion avoidance mechanisms. We describe in this paper, a new TCP rate control scheme based on a simple recursive algorithm. The idea behind the algorithm is to match the offered network load to the available resources by modifying at an intermediate network element, the receiver's advertised window in TCP acknowledgments returning to the source. We show through simulations that the scheme can efficiently control TCP traffic to limit queue buildups and buffer requirements at the network nodes, resulting in significant improvements in delay, packet loss rates, fairness in the distribution of the maximum achievable window size, and link utilization.
AB - In TCP, congestion control as well as error recovery are implemented by a sliding window. The dynamics of TCP specifically, a mismatch between the TCP window and the bandwidth-delay product of the network can sometimes cause the network switches or routers to accumulate large queues, resulting in buffer overflows, reduced throughput, unfairness and underutilization. It is generally accepted that there is a limit to how much control can be accomplished from the congestion control mechanisms in the end systems. Some mechanisms are needed in the intermediate network elements to complement the endpoint congestion avoidance mechanisms. We describe in this paper, a new TCP rate control scheme based on a simple recursive algorithm. The idea behind the algorithm is to match the offered network load to the available resources by modifying at an intermediate network element, the receiver's advertised window in TCP acknowledgments returning to the source. We show through simulations that the scheme can efficiently control TCP traffic to limit queue buildups and buffer requirements at the network nodes, resulting in significant improvements in delay, packet loss rates, fairness in the distribution of the maximum achievable window size, and link utilization.
KW - Bandwidth management
KW - Congestion control
KW - TCP rate control
UR - http://www.scopus.com/inward/record.url?scp=0035452202&partnerID=8YFLogxK
U2 - 10.1016/S0166-5316(01)00029-3
DO - 10.1016/S0166-5316(01)00029-3
M3 - Article
AN - SCOPUS:0035452202
SN - 0166-5316
VL - 46
SP - 1
EP - 44
JO - Performance Evaluation
JF - Performance Evaluation
IS - 1
ER -