Adaptive vegas: a solution of unfairness problem for TCP vegas

Authors:
Qing Gao;Qinghe Yin
Affiliations:
Institute for Infocomm Research, Singapore;Institute for Infocomm Research, Singapore
Venue:
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Year:
2005

Citing 3
Cited 0

TCP Vegas: new techniques for congestion detection and avoidance

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
TCP and explicit congestion notification

ACM SIGCOMM Computer Communication Review
TCP Vegas: end to end congestion avoidance on a global Internet

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the unfairness problem for TCP Vegas. There are three sources to cause the unfairness for Vegas: α β, over-estimation of base RTT, and multiple congested gateways. To solve the unfairness caused by multiple congested gateways, we propose a new version of Vegas–Adaptive Vegas(A-Vegas) which assigns the value of parameters adaptively according to the number of congested gateways. Simulation shows that A-Vegas not only can solve the unfairness caused by multiple congested gateways, it also reduces the unfairness caused by over-estimation. We also introduce a new fairness index, RNBS (normal bandwidth sharing ratio), which indicates the ratio of the amount of bandwidth grabbed by a connection to the uniformly distributed bandwidth.