2020
DOI: 10.1109/tnsm.2019.2962607
|View full text |Cite
|
Sign up to set email alerts
|

Congestion Control in the Wild—Investigating Content Provider Fairness

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
2
1

Relationship

1
4

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 27 publications
0
5
0
Order By: Relevance
“…TCP Congestion Control. Many of the congestion control studies have especially looked at CUBIC [17] and BBR [10] and found that BBR dominates in under-buffered scenarios causing packet loss and making CUBIC back off, while it is disadvantaged in over-buffered scenarios [18,23,26,28]. Here, CUBIC, as a loss-based algorithm, fills the buffer and increases the queuing delay which makes BBR back off.…”
Section: Background and Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…TCP Congestion Control. Many of the congestion control studies have especially looked at CUBIC [17] and BBR [10] and found that BBR dominates in under-buffered scenarios causing packet loss and making CUBIC back off, while it is disadvantaged in over-buffered scenarios [18,23,26,28]. Here, CUBIC, as a loss-based algorithm, fills the buffer and increases the queuing delay which makes BBR back off.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Today, this idea is most commonly implemented through a stochastic fair queuing (SFQ) which performs similar to a true fair queuing when the number of flows is limited. In fact, several works (e.g., [22,23]) show that AQM using this SFQ (often called flow-queuing) can create flow-rate fairness while effectively limiting congestion, even though there are no comprehensive studies available in literature.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Unfairness between paced and unpaced Reno flows was shown by [2,86]. Fairness work is about how algorithms ought to share resources, and usually shows that algorithms are unfair in simulations or in a lab [5,15,16,23,43,44,50,56,71,81,82,85]. Our work does not address how algorithms should share resources, but rather how to avoid experimental bias when they do.…”
Section: Related Workmentioning
confidence: 99%
“…There has been extensive study of the fairness of congestion control algorithms (e.g. [5,15,16,23,43,44,56,71,81,82,84,85]). A treatment algorithm is often said to be unfair if it gets a larger share of throughput when competing against a control algorithm.…”
Section: Test 3: Congestion Control Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation