2003
DOI: 10.1016/s0166-5316(03)00064-6
|View full text |Cite
|
Sign up to set email alerts
|

Analysis and enhancement of TCP Vegas congestion control in a mixed TCP Vegas and TCP Reno network scenario

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 21 publications
(8 citation statements)
references
References 23 publications
0
8
0
Order By: Relevance
“…[13]have evaluatedthe behavior of TCP Vegas and TCP Reno in a wired but heterogeneous network.Thehave concluded that it is not possible to achieve fairness in TCP Vegas and TCP Reno.…”
Section: Literature Reviewmentioning
confidence: 99%
“…[13]have evaluatedthe behavior of TCP Vegas and TCP Reno in a wired but heterogeneous network.Thehave concluded that it is not possible to achieve fairness in TCP Vegas and TCP Reno.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Some of these proposals, like Compound TCP [21], TCP Illinois [22] and RACC [23], are hybrid loss-and delay-based mechanisms, whereas others (e.g., FAST TCP [24], NewVegas [25], or CODE TCP [26]) are variants of Vegas based primarily on delays. 4 Though not specific to Vegas, there are also proposals, such as [27], [28], aiming at improving the coexistence of loss-based and delay-based congestion-controlled flows.…”
Section: A Tcp Vegasmentioning
confidence: 99%
“…In this section, we present a summary of these two congestion control mechanisms and explain why they are incompatible. Then two algorithms, NewVegas [17] and Vegas-A [18], that attempt to solve the fairness problem between Vegas and Reno are described.…”
Section: Related Workmentioning
confidence: 99%
“…Second, if no router provides useful information, such schemes cannot function properly. The second type attempt to solve the incompatibility problem by dynamically adjusting a and b based on feedback from the network [17,18]. Such schemes attempt to detect whether or not Reno connections exist in the network.…”
Section: Incompatibility Of Tcp Vegas With Tcp Renomentioning
confidence: 99%
See 1 more Smart Citation