Binomial congestion control algorithms
By Deepak Bansal, Hari Balakrishnan. Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 2001
427 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/7a4ca1c88a38318370574b52469b2aa97d24c6d7
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computer Networks and Communications
- Steven H. Low
- Hari Balakrishnan
- Keith Winstein
- Mung Chiang
- Deborah Estrin
- Scott Shenker
- Mohamed F. Younis
- Xuxun Liu
In Electrical and Electronic Engineering
- Steven H. Low
- Keith Winstein
- Hari Balakrishnan
- Mung Chiang
- Rajit Gadh
- Wenbo Shi
- Chi-Cheng Peter Chu
- Daniel D. Molzahn
Citations in the corpus
- A duality model of TCP and queue management algorithms (2003, methodology): “, [3] and [10], assume that Reno increases its window by 1 every round-trip time deterministically.”
- TCP ex machina: computer-generated congestion control (2013, methodology): “Compound TCP is more complicated than a straightforward hybrid of Reno and Vegas; for example, the delay-based window adjustment uses a binomial algorithm [6].”
- Stochastic Forecasts Achieve High Throughput and Low Delay over Cellular Networks (2013, neutral): “Schemes such as “TCP-friendly” equation-based rate control [7] and binomial congestion control [1] exhibit slower transmission rate variations than TCP, and in principle could introduce lower delay, but perform poorly in the face of sudden rate changes [2].”
- Enabling conferencing applications on the internet using an overlay muilticast architecture (2001, neutral): “vidual overlay link is ensured by running some TCP-friendly protocol for streaming media applications [1, 5, 14].”