Pseudo-rate TCP: a congestion avoidance scheme with nearly optimized fairness and throughput

Authors:
J.-R Chen;Y.-C Chen
Affiliations:
Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 30056, Taiwan;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 30056, Taiwan
Venue:
Computer Communications
Year:
1999

Citing 6
Cited 0

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
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

Quantified Score

Hi-index	0.24

Visualization

Abstract

As the bandwidth requirement on the Internet grows, the efficiency of networking protocol becomes an important concern. This paper proposes a so-called pseudo-rate TCP, which features both better fairness and higher throughput than TCP Vegas by exponentially increasing the window size to a derived bound. The pseudo-rate TCP avoids the typical problem that sources with shorter round-trip times always get better chance in allocating the bandwidth. We discuss two key mechanisms designed for pseudo-rate TCP, and compare its performance with TCP Vegas through system simulation.