2005
DOI: 10.1007/11516798_12
|View full text |Cite
|
Sign up to set email alerts
|

SRF TCP: A TCP-Friendly and Fair Congestion Control Method for High-Speed Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2008
2008
2012
2012

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(12 citation statements)
references
References 9 publications
0
12
0
Order By: Relevance
“…Our analysis in this section clearly illustrates that several aspects of TCP congestion-control contribute towards an RTT-based bias in throughput allocation-these include the window-growth in both Slow-start and Congestion-avoidance, as well as the use of a common initial window and a common Slow-start Threshold. Unfortunately, most attempts at alleviating RTT-unfairness focus only on the steady-state behavior of Congestion-avoidance [15], [16]. Clearly, in order to be truly RTT-fair, a congestion-control protocol would need to address each of these sources of bias.…”
Section: Rtt-bias With Persistent Queuingmentioning
confidence: 99%
See 2 more Smart Citations
“…Our analysis in this section clearly illustrates that several aspects of TCP congestion-control contribute towards an RTT-based bias in throughput allocation-these include the window-growth in both Slow-start and Congestion-avoidance, as well as the use of a common initial window and a common Slow-start Threshold. Unfortunately, most attempts at alleviating RTT-unfairness focus only on the steady-state behavior of Congestion-avoidance [15], [16]. Clearly, in order to be truly RTT-fair, a congestion-control protocol would need to address each of these sources of bias.…”
Section: Rtt-bias With Persistent Queuingmentioning
confidence: 99%
“…All non-bottleneck links have a 1 Gbps capacity, and the values of RT T min for the different senders varies from 50ms to 500ms. We also use this topology for evaluating the fairness yielded by NewReno, SRF [16], and Libra [15]. We ensure that all transfers experience packet loss nearly simultaneously, by forcing packet drops in each of the transfers when the bottleneck buffers approach full-occupancy.…”
Section: Prototypingmentioning
confidence: 99%
See 1 more Smart Citation
“…This is because, primarily driven by the goal of not overloading the network, all previous protocols adopt two limiting design features: 1) Only a single (larger) sending rate is probed for over a round-trip time. This is true for all previous protocols, including recent ones, such as HighSpeed TCP, FAST, Scalable, CUBIC, and PCP [1], [2], [3], [4], [5], [6], [7]. This legacy design decision is perhaps motivated by the fact that unless the single rate is deemed acceptable (not too high), other rates should not be probed for.…”
Section: A the Problem: Slow Feedback Loopmentioning
confidence: 99%
“…As a result of these two design limitations, most protocolseven the recent ones designed for high-speed networks [2], [3], [4], [5], [6], [7]-take a fairly long time for converging to the avail-bw. For instance, Table I lists the experimentallyobserved times taken by a single transfer for acquiring an additional spare capacity of 1 Gbps that suddenly becomes available.…”
mentioning
confidence: 99%