The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.
FAST TCP: Motivation, Architecture, Algorithms, Performance
Abstract
We describe FAST TCP, a new TCP congestion control algorithm for high-speed long-latency networks, from design to implementation. We highlight the approach taken by FAST TCP to address the four difficulties which the current TCP implementation has at large windows. We describe the architecture and summarize some of the algorithms implemented in our prototype. We characterize its equilibrium and stability properties. We evaluate it experimentally in terms of throughput, fairness, stability, and responsiveness
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600523 · Cited by 2,399
The Art of Computer Systems Performance Analysis.
Jain, R. (1990) · Int. CMG Conference · Cited by 2,280
(1992) · Choice Reviews Online · doi:10.5860/choice.29-3347 · Cited by 2,095
Fair end-to-end window-based congestion control
Mo, J., & Walrand, J. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.879343 · Cited by 2,095
Optimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
Self-citationAnalysis of the increase and decrease algorithms for congestion avoidance in computer networks
Chiu, D.-M., & Jain, R. (1989) · Computer Networks and ISDN Systems · doi:10.1016/0169-7552(89)90019-6 · Cited by 1,902
TCP Vegas: end to end congestion avoidance on a global Internet
Brakmo, L. S., & Peterson, L. L. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.464716 · Cited by 1,699
The macroscopic behavior of the TCP congestion avoidance algorithm
Mathis, M., Semke, J., Mahdavi, J., & Ott, T. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/263932.264023 · Cited by 1,495
Equation-based congestion control for unicast applications
Floyd, S., Handley, M., Padhye, J., & Widmer, J. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347397 · Cited by 1,414
The NewReno Modification to TCP's Fast Recovery Algorithm
Henderson, T., Floyd, S., Gurtov, A., & Nishida, Y. (2012) · doi:10.17487/rfc6582 · Cited by 1,410
HighSpeed TCP for Large Congestion Windows
Floyd, S. (2003) · doi:10.17487/rfc3649 · Cited by 1,165
TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms
Stevens, W. (1997) · doi:10.17487/rfc2001 · Cited by 1,143
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 Extensions for High Performance
Borman, D., Braden, B., & Jacobson, V. (2014) · doi:10.17487/rfc7323 · Cited by 1,010
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 performance of TCP/IP for networks with high bandwidth-delay products and random loss
Lakshman, T. V., & Madhow, U. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.611099 · Cited by 928
Dummynet: a simple approach to the evaluation of network protocols
Rizzo, L. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/251007.251012 · Cited by 888
Scalable TCP: improving performance in highspeed wide area networks
Kelly, T. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/956981.956989 · Cited by 869
Analysis and design of controllers for AQM routers supporting TCP flows
Hollot, C. V., Misra, V., Towsley, D., & Gong, W. (2002) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2002.1008360 · Cited by 859
The Mathematics of Internet Congestion Control
(2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841398 · Cited by 821
The Mathematics of Internet Congestion Control
Srikant, R. (2004) · Systems & Control: Foundations & Applications · doi:10.1007/978-0-8176-8216-3 · Cited by 800
(2002) · IEEE Control Systems · doi:10.1109/37.980245 · Cited by 796
TCP Extensions for High Performance
Jacobson, V., Braden, R., & Borman, D. (1992) · doi:10.17487/rfc1323 · Cited by 746
A duality model of TCP and queue management algorithms
Low, S. H. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.815297 · Cited by 653
Self-citationThe NewReno Modification to TCP's Fast Recovery Algorithm
Floyd, S., & Henderson, T. (1999) · doi:10.17487/rfc2582 · Cited by 631
FAST TCP: motivation, architecture, algorithms, performance
Jin, C., Wei, D. X., & Low, S. H. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354670 · Cited by 625
Self-citationMathematics Unlimited — 2001 and Beyond
Engquist, B. E., & Schmid, W. (2001) · Springer eBooks · doi:10.1007/978-3-642-56478-9 · Cited by 514
Improving the start-up behavior of a congestion control scheme for TCP
Hoe, J. C. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248180 · Cited by 461
End-to-end congestion control schemes: utility functions, random losses and ecn marks
Kunniyur, S., & Srikant, R. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818183 · Cited by 448
TCP Westwood: End-to-End Congestion Control for Wired/Wireless Networks
Casetti, C., Gerla, M., Mascolo, S., Sanadidi, M. Y., & Wang, R. (2002) · Wireless Networks · doi:10.1023/a:1016590112381 · Cited by 421
Gilles, A. (1992) · The Computer Journal · doi:10.1093/comjnl/35.3.207 · Cited by 401
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
Jain, R. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/74681.74686 · Cited by 319
Scalable laws for stable network congestion control
Paganini, F., Doyle, J., & Low, S. (2003) · Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228) · doi:10.1109/cdc.2001.980095 · Cited by 276
Self-citationA Unifying Passivity Framework for Network Flow Control
Wen, J. T.-Y., & Arcak, M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.822858 · Cited by 230
Improving the start-up behavior of a congestion control scheme for TCP
Hoe, J. C. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/248157.248180 · Cited by 202
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
Eliminating periodic packet losses in the 4.3-Tahoe BSD TCP congestion control algorithm
Wang, Z., & Crowcroft, J. (1992) · ACM SIGCOMM Computer Communication Review · doi:10.1145/141800.141801 · Cited by 113
Evaluation of Advanced TCP Stacks on Fast Long-Distance Production Networks
Bullot, H., Cottrell, R. L., & Hughes-Jones, R. E. (2003) · Journal of Grid Computing · doi:10.1023/b:grid.0000037555.53402.4f · Cited by 94
A spectrum of TCP-friendly window-based congestion control algorithms
Jin, S., Guo, L., Matta, I., & Azer Bestavros, C. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.813046 · Cited by 79
FAST TCP: fairness and queuing issues
Tan, L., Cao, Y., & Zukerman, M. (2005) · IEEE Communications Letters · doi:10.1109/lcomm.2005.1496608 · Cited by 42
Analysis and design of congestion control in synchronised communication networks
Shorten, R. N., Leith, D. J., Foy, J., & Kilduff, R. (2005) · Maynooth University ePrints and eTheses Archive (Maynooth University) · Cited by 27
Cited by
Alizadeh, M., Greenberg, A., Maltz, D. A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., & Sridharan, M. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851192 · Cited by 1,877
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Self-citationCVXGEN: a code generator for embedded convex optimization
Mattingley, J., & Boyd, S. (2012) · Optimization and Engineering · doi:10.1007/s11081-011-9176-9 · Cited by 790
FAST TCP: motivation, architecture, algorithms, performance
Jin, C., Wei, D. X., & Low, S. H. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354670 · Cited by 625
Self-citationThe Globus Striped GridFTP Framework and Server
Allcock, W., Bresnahan, J., Kettimuthu, R., & Link, M. (2005) · ACM/IEEE SC 2005 Conference (SC'05) · doi:10.1109/sc.2005.72 · Cited by 601
Metadata
- Authors
- Wei, D. X., Jin, C., Low, S. H., & Hegde, S.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2006-12
- Volume
- 14
- Issue
- 6
- Pages
- 1246-1259
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2071314114
- Cited by
- 955
- References
- 47
- FWCI
- 129.47
- 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.