SIGCOMM MIT paper: Starvation in e2e congestion control
120 views
Skip to first unread message
Dave Taht
Aug 4, 2022, 3:05:55 PM8/4/22
to bloat, BBR Development, Dave Taht via Starlink, venk...@csail.mit.edu, Mohammad Alizadeh, Hari Balakrishnan
Perhaps it's obvious to the authors that FQ opens up new possibilities
for delay based convergence. Otherwise, pretty good:
"We prove that when two flows using the same CCA share a bottleneck
link, if the non-congestive delay variations exceed double the
difference between the maximum and minimum queueing delay at
equilibrium, then there are patterns of non-congestive delay where one
flow will get arbitrarily low throughput compared to the other. Our
theorem shows that CCAs have
to choose at most two out of three properties: high through put,
convergence to a small and bounded delay range, and no starvation."
Paper: http://people.csail.mit.edu/venkatar/cc-starvation.pdf
Article: https://news.mit.edu/2022/algorithm-computer-network-bandwidth-0804
--
FQ World Domination pending: https://blog.cerowrt.org/post/state_of_fq_codel/
Dave Täht CEO, TekLibre, LLC
for delay based convergence. Otherwise, pretty good:
"We prove that when two flows using the same CCA share a bottleneck
link, if the non-congestive delay variations exceed double the
difference between the maximum and minimum queueing delay at
equilibrium, then there are patterns of non-congestive delay where one
flow will get arbitrarily low throughput compared to the other. Our
theorem shows that CCAs have
to choose at most two out of three properties: high through put,
convergence to a small and bounded delay range, and no starvation."
Paper: http://people.csail.mit.edu/venkatar/cc-starvation.pdf
Article: https://news.mit.edu/2022/algorithm-computer-network-bandwidth-0804
--
FQ World Domination pending: https://blog.cerowrt.org/post/state_of_fq_codel/
Dave Täht CEO, TekLibre, LLC
Reply all
Reply to author
Forward
0 new messages