Conference Proceedings of the 2003 IEEE International
DOI: 10.1109/pccc.2003.1203713
|View full text |Cite
|
Sign up to set email alerts
|

TCP Vegas-A: solving the fairness and rerouting issues of TCP Vegas

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 12 publications
0
6
0
Order By: Relevance
“…However, the first version of Vegas had severe issues with the Delayed ACK mechanism, which affected its RTT estimation, and with links with high latency [112]. These issues prompted the development of several improvements, like Vegas-A [128], which addresses rerouting and bandwidth sharing fairness, Vegas-V [129], which increases the aggressiveness of the original algorithm, while remaining fair to other flows, and Adaptive Vegas [130], where adaptive refers to the ability of the algorithm to change its parameters according to the statistics of throughput and RTT variation. Some specialized versions were developed for wireless [131] and mobile [132] ad hoc networks; three particular modifications became part of the so called New Vegas algorithm [133].…”
Section: B Delay-based Mechanismsmentioning
confidence: 99%
“…However, the first version of Vegas had severe issues with the Delayed ACK mechanism, which affected its RTT estimation, and with links with high latency [112]. These issues prompted the development of several improvements, like Vegas-A [128], which addresses rerouting and bandwidth sharing fairness, Vegas-V [129], which increases the aggressiveness of the original algorithm, while remaining fair to other flows, and Adaptive Vegas [130], where adaptive refers to the ability of the algorithm to change its parameters according to the statistics of throughput and RTT variation. Some specialized versions were developed for wireless [131] and mobile [132] ad hoc networks; three particular modifications became part of the so called New Vegas algorithm [133].…”
Section: B Delay-based Mechanismsmentioning
confidence: 99%
“…However, it still retains the other mechanism of Reno, and a packet loss can still be detected by retransmission timeout if the other mechanisms fail. Issues identified with TCP Vegas are problems of rerouting, persistent congestion, and discrepancy in flow rate tied with starting times and link bandwidth [9].…”
Section: Existing Variants Of Tcpmentioning
confidence: 99%
“…To improve the performance of Vegas, Srijith et al . proposed a modified Vegas, which operates in two different modes depending on the count value.…”
Section: Related Workmentioning
confidence: 99%
“…To improve the performance of Vegas, Srijith et al [33] proposed a modified Vegas, which operates in two different modes depending on the count value. If the measured RTT continuously increases but the congestion window remains unchanged, the sender acts in a moderate mode and simply increases the count value by one.…”
Section: Related Studies On Bias Of Tcp Vegasmentioning
confidence: 99%