The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Scalable TCP: improving performance in highspeed wide area networks
Abstract
TCP congestion control can perform badly in highspeed wide area networks because of its slow response with large congestion windows. The challenge for any alternative protocol is to better utilize networks with high bandwidth-delay products in a simple and robust manner without interacting badly with existing traffic. Scalable TCP is a simple sender-side alteration to the TCP congestion window update algorithm. It offers a robust mechanism to improve performance in highspeed wide area networks using traditional TCP receivers. Scalable TCP is designed to be incrementally deployable and behaves identically to traditional TCP stacks when small windows are sufficient. The performance of the scheme is evaluated through experimental results gathered using a Scalable TCP implementation for the Linux operating system and a gigabit transatlantic network. The preliminary results gathered suggest that the deployment of Scalable TCP would have negligible impact on existing network traffic at the same time as improving bulk transfer performance in highspeed wide area 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
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
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 Addition of Explicit Congestion Notification (ECN) to IP
Ramakrishnan, K., Floyd, S., & Black, D. (2001) · doi:10.17487/rfc3168 · Cited by 1,512
Modeling TCP Reno performance: a simple model and its empirical validation
Padhye, J., Firoiu, V., Towsley, D. F., & Kurose, J. F. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.842137 · Cited by 1,184
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 Extensions for High Performance
Borman, D., Braden, B., & Jacobson, V. (2014) · doi:10.17487/rfc7323 · Cited by 1,010
TCP Extensions for High Performance
Jacobson, V., Braden, R., & Borman, D. (1992) · doi:10.17487/rfc1323 · Cited by 746
Dynamics of IP traffic: a study of the role of variability and the impact of control
Feldmann, A., Gilbert, A. C., Huang, P., & Willinger, W. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316235 · Cited by 390
An Extension to the Selective Acknowledgement (SACK) Option for TCP
Floyd, S., Mahdavi, J., Mathis, M., & Podolsky, M. (2000) · doi:10.17487/rfc2883 · Cited by 370
Cited by
CUBIC: a new TCP-friendly high-speed TCP variant
Ha, S., Rhee, I., & Xu, L. (2008) · ACM SIGOPS Operating Systems Review · doi:10.1145/1400097.1400105 · Cited by 2,287
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
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
FAST TCP: Motivation, Architecture, Algorithms, Performance
Wei, D. X., Jin, C., Low, S. H., & Hegde, S. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.886335 · Cited by 955
Free-Space Optical Communications
Chan, V. W. S. (2006) · Journal of Lightwave Technology · doi:10.1109/jlt.2006.885252 · Cited by 865
Metadata
- Authors
- Kelly, T.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2003-04
- Volume
- 33
- Issue
- 2
- Pages
- 83-91
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2067764765
- Cited by
- 869
- References
- 11
- FWCI
- 98.20
- 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.