The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
TCP-Illinois: A loss- and delay-based congestion control algorithm for high-speed networks
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Modeling TCP throughput: a simple model and its empirical validation
Padhye, J., Firoiu, V., Towsley, D., & Kurose, J. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285291 · Cited by 2,106
Congestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190317 · Cited by 1,198
HighSpeed TCP for Large Congestion Windows
Floyd, S. (2003) · doi:10.17487/rfc3649 · Cited by 1,165
Congestion control for high bandwidth-delay product networks
Katabi, D., Handley, M., & Rohrs, C. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633035 · Cited by 1,096
TCP Selective Acknowledgment Options
Mathis, M., Mahdavi, J., Floyd, S., & Romanow, A. (1996) · doi:10.17487/rfc2018 · Cited by 972
Binary increase congestion control (BIC) for fast long-distance networks
Xu, L., Harfoush, K., & Rhee, I. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354672 · Cited by 959
The NewReno Modification to TCP's Fast Recovery Algorithm
Floyd, S., & Henderson, T. (1999) · doi:10.17487/rfc2582 · Cited by 631
A Compound TCP Approach for High-Speed and Long Distance Networks
Tan, K., Song, J., Zhang, Q., & Sridharan, M. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.188 · Cited by 584
A positive systems model of TCP-like congestion control: asymptotic results
Shorten, R., Wirth, F., & Leith, D. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.876178 · Cited by 501
Delay-based congestion avoidance for TCP
Martin, J., Nilsson, A. A., & Rhee, I. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.813038 · Cited by 132
NS-2 TCP-Linux: an NS-2 TCP implementation with congestion control algorithms from Linux
Wei, D. X., & Cao, P. (2006) · doi:10.1145/1190455.1190463 · Cited by 106
AIMD, fairness and fractal scaling of TCP traffic
Baccelli, F., & Hong, D. (2003) · Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) · doi:10.1109/infcom.2002.1019264 · Cited by 106
Analysis and design of AIMD congestion control algorithms in communication networks
Shorten, R. N., Leith, D. J., Foy, J., & Kilduff, R. (2004) · Automatica · doi:10.1016/j.automatica.2004.09.017 · Cited by 93
Liu, S., Başar, T., & Srikant, R. (2006) · doi:10.1145/1190095.1190166 · Cited by 93
Self-citationIs the round-trip time correlated with the number of packets in flight?
Biaz, S., & Vaidya, N. H. (2003) · doi:10.1145/948205.948240 · Cited by 47
Flow Control as a Stochastic Optimal Control Problem with Incomplete Information
Miller, B. M., Avrachenkov, K. E., Stepanyan, K. V., & Miller, G. B. (2005) · Problems of Information Transmission · doi:10.1007/s11122-005-0020-8 · Cited by 41
Flow control as stochastic optimal control problem with incomplete information
Miller, B. M., Avrachenkov, K. E., Stepanyan, K. V., & Miller, G. B. (2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2005.1498358 · Cited by 33
Improving efficiency-friendliness tradeoffs of TCP congestion control algorithm
Shimonishi, H., & Murase, T. (2005) · Globecom · doi:10.1109/glocom.2005.1577631 · Cited by 28
Cited by
Network Optimization and Control
Shakkottai, S., & Srikant, R. (2007) · Foundations and Trends® in Networking · doi:10.1561/1300000007 · Cited by 320
Self-citationHost-to-Host Congestion Control for TCP
Afanasyev, A., Tilley, N., Reiher, P., & Kleinrock, L. (2010) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2010.042710.00114 · Cited by 278
Classic Meets Modern: a Pragmatic Learning-Based Congestion Control for the Internet
Abbasloo, S., Yen, C.-Y., & Chao, H. J. (2020) · Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication · doi:10.1145/3387514.3405892 · Cited by 255
Metadata
- Authors
- Liu, S., Başar, T., & Srikant, R.
- Venue
- Performance Evaluation
- Publisher
- Elsevier BV
- Published
- 2008-06
- Volume
- 65
- Issue
- 6-7
- Pages
- 417-440
- ISSN
- 0166-5316 (ISSN-L)
- OpenAlex
- W2081787917
- Cited by
- 259
- References
- 20
- FWCI
- 29.08
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.