An end-to-end flow control approach based on round trip time

Authors:
Jin-Ru Chen;Yaw-Chung Chen;Chun-Liang Lee
Affiliations:
Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 30050, Taiwan;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 30050, Taiwan;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 30050, Taiwan
Venue:
Computer Communications
Year:
2000

Citing 7
Cited 1

A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks

ACM SIGCOMM Computer Communication Review
A control-theoretic approach to flow control

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
A new congestion control scheme: slow start and search (Tri-S)

ACM SIGCOMM Computer Communication Review
Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm

ACM SIGCOMM Computer Communication Review
Forward acknowledgement: refining TCP congestion control

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Performance Comparison between TCP Slow-Start and a New Adaptive Rate-Based Congestion Avoidance Scheme

MASCOTS '94 Proceedings of the Second International Workshop on Modeling, Analysis, and Simulation On Computer and Telecommunication Systems
TCP Vegas: end to end congestion avoidance on a global Internet

IEEE Journal on Selected Areas in Communications

QoS-Adaptive Multimedia Resource Regulation Scheme Based on Priority Classification

ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)

Quantified Score

Hi-index	0.24

Visualization

Abstract

Traditional TCP flow control schemes, such as Tahoe and Reno, continuously increase the window size until possible packet loss is detected. These schemes generate congestion unnecessarily by themselves and utilize the buffer space inefficiently. Therefore, Vegas was proposed to accommodate the drawbacks. It uses the measured round-trip time (RTT) to obtain the information required for the flow control. In this work, we propose a flow control scheme, RTT-based TCP, which uses the RTT directly to control the window size adjustment. RTT-based TCP comprises four mechanisms: the modified exponential window increment, the RTT measurement, the queue occupancy estimation, and the quick queue-occupancy reduction. Simulation results show that RTT-based TCP outperforms Vegas in the aspects of throughput, fairness and efficiency of buffer usage.