Fairness and stability of congestion control mechanisms of TCP

Go Hasegawa, Masayuki Murata, Hideo Miyahara

Research output: Contribution to journalArticlepeer-review

23 Citations (Scopus)


In this paper, we focus on fairness and stability of the congestion control mechanisms adopted in several versions of TCP by investigating their time-transient behaviors through an analytic approach. In addition to TCP Tahoe and TCP Reno, we also consider TCP Vegas which has been recently proposed for higher throughput, and enhanced TCP Vegas, which is proposed in this paper for fairness enhancements. We consider the homogeneous case, where two connections have the equivalent propagation delays, and the heterogeneous case, where each connection has different propagation delay. We show that TCP Tahoe and TCP Reno can achieve fairness among connections in the homogeneous case, but cannot in the heterogeneous case. We also show that TCP Vegas can provide almost fair service among connection, but there is some unfairness caused by the essential nature of TCP Vegas. Finally, we explain the effectiveness of our enhanced TCP Vegas in terms of fairness and throughput.

Original languageEnglish
Pages (from-to)167-184
Number of pages18
JournalTelecommunication Systems
Issue number1-2
Publication statusPublished - 2000


Dive into the research topics of 'Fairness and stability of congestion control mechanisms of TCP'. Together they form a unique fingerprint.

Cite this