The DOI matches its Crossref record.
TCP Extensions for High Performance
Abstract
This memo presents a set of TCP extensions to improve performance over large bandwidth*delay product paths and to provide reliable operation over very high-speed paths. It defines new TCP options for scaled windows and timestamps, which are designed to provide compatible interworking with TCP's that do not implement the extensions. The timestamps are used for two distinct mechanisms: RTTM (Round Trip Time Measurement) and PAWS (Protect Against Wrapped Sequences). Selective acknowledgments are not included in this memo.
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
Cited by
Jacobson, V., Smetters, D. K., Thornton, J. D., Plass, M. F., Briggs, N. H., & Braynard, R. L. (2009) · Proceedings of the 5th international conference on Emerging networking experiments and technologies · doi:10.1145/1658939.1658941 · Cited by 4,031
Self-citationTCP 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
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
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
Simulation-based comparisons of Tahoe, Reno and SACK TCP
Fall, K., & Floyd, S. (1996) · ACM SIGCOMM Computer Communication Review · doi:10.1145/235160.235162 · Cited by 1,148
I-TCP: indirect TCP for mobile hosts
Bakre, A., & Badrinath, B. R. (2002) · Proceedings of 15th International Conference on Distributed Computing Systems · doi:10.1109/icdcs.1995.500012 · Cited by 1,092
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
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
Effective erasure codes for reliable computer communication protocols
Rizzo, L. (1997) · ACM SIGCOMM Computer Communication Review · doi:10.1145/263876.263881 · Cited by 916
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
Improving TCI/IP performance over wireless networks
Balakrishnan, H., Seshan, S., Amir, E., & Katz, R. H. (1995) · Proceedings of the 1st annual international conference on Mobile computing and networking - MobiCom '95 · doi:10.1145/215530.215544 · Cited by 757
Improving reliable transport and handoff performance in cellular wireless networks
Balakrishnan, H., Seshan, S., & Katz, R. H. (1995) · Wireless Networks · doi:10.1007/bf01985757 · Cited by 677
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
An end-to-end approach to host mobility
Snoeren, A. C., & Balakrishnan, H. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345938 · Cited by 595
Measurements and analysis of end-to-end Internet dynamics
Paxson, V. (1997) · doi:10.2172/551971 · Cited by 572
A survey of covert channels and countermeasures in computer network protocols
Zander, S., Armitage, G., & Branch, P. (2007) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2007.4317620 · Cited by 561
Remote Physical Device Fingerprinting
Kohno, T., Broido, A., & Claffy, K. C. (2005) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2005.26 · Cited by 521
On the constancy of internet path properties
Zhang, Y., & Duffield, N. (2001) · Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement - IMW '01 · doi:10.1145/505202.505228 · Cited by 466
Hypertext Transfer Protocol Version 2 (HTTP/2)
Belshe, M., & Peon, R. (2015) · doi:10.17487/rfc7540 · Cited by 450
Safe and effective fine-grained TCP retransmissions for datacenter communication
Vasudevan, V., Phanishayee, A., Shah, H., Krevat, E., Andersen, D. G., Ganger, G. R., Gibson, G. A., & Mueller, B. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592604 · Cited by 427
The Eifel algorithm: making TCP robust against spurious retransmissions
Ludwig, R., & Katz, R. H. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505688.505692 · Cited by 393
Enhancing TCP Over Satellite Channels using Standard Mechanisms
Allman, M., Glover, D., & Sanchez, L. (1999) · doi:10.17487/rfc2488 · Cited by 382
On estimating end-to-end network path properties
Allman, M., & Paxson, V. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316230 · Cited by 344
Towards an understanding of anti-virtualization and anti-debugging behavior in modern malware
Chen, X., Andersen, J., Mao, Z. M., Bailey, M., & Nazario, J. (2008) · 2008 IEEE International Conference on Dependable Systems and Networks With FTCS and DCC (DSN) · doi:10.1109/dsn.2008.4630086 · Cited by 284
Transport protocols for Internet-compatible satellite networks
Henderson, T. R., & Katz, R. H. (1999) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.748815 · Cited by 280
Is it still possible to extend TCP?
Honda, M., Nishida, Y., Raiciu, C., Greenhalgh, A., Handley, M., & Tokuda, H. (2011) · Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference · doi:10.1145/2068816.2068834 · Cited by 272
Hot or not: Revealing hidden services by their clock skew
Murdoch, S. J. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180410 · Cited by 253
Semke, J., Mahdavi, J., & Mathis, M. (1998) · Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/285237.285292 · Cited by 253
Metadata
- Authors
- Borman, D., Braden, B., & Jacobson, V.
- Publisher
- RFC Editor
- Published
- 2014-09
- OpenAlex
- W1714781699
- Cited by
- 1,010
- References
- 0
- Type
- report
- 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.