The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
TCP Vegas: new techniques for congestion detection and avoidance
Open accessAbstract
Vegas is a new implementation of TCP that achieves between 40 and 70% better throughput, with one-fifth to one-half the losses, as compared to the implementation of TCP in the Reno distribution of BSD Unix. This paper motivates and describes the three key techniques employed by Vegas, and presents the results of a comprehensive experimental performance study—using both simulations and measurements on the Internet—of the Vegas and Reno implementations of TCP.
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
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
Analysis 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 Extensions for High Performance
Borman, D., Braden, B., & Jacobson, V. (2014) · doi:10.17487/rfc7323 · Cited by 1,010
A control-theoretic approach to flow control
Keshav, S. (1991) · Proceedings of the conference on Communications architecture & protocols · doi:10.1145/115992.115995 · Cited by 752
Observations on the dynamics of a congestion control algorithm: the effects of two-way traffic
Zhang, L., Shenker, S., & Clark, D. D. (1991) · Proceedings of the conference on Communications architecture & protocols · doi:10.1145/115992.116006 · Cited by 375
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
TCP extensions for long-delay paths
Jacobson, V., & Braden, R. T. (1988) · doi:10.17487/rfc1072 · Cited by 185
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
AntNet: Distributed Stigmergetic Control for Communications Networks
Di Caro, G., & Dorigo, M. (1998) · Journal of Artificial Intelligence Research · doi:10.1613/jair.530 · Cited by 1,579
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
Boutaba, R., Salahuddin, M. A., Limam, N., Ayoubi, S., Shahriar, N., Estrada-Solano, F., & Caicedo, O. M. (2018) · Journal of Internet Services and Applications · doi:10.1186/s13174-018-0087-2 · Cited by 1,036
TCP and explicit congestion notification
Floyd, S. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205511.205512 · Cited by 1,016
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
End-to-end Internet packet dynamics
Paxson, V. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.779192 · Cited by 908
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
Dynamics of random early detection
Lin, D., & Morris, R. (1997) · Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/263105.263154 · Cited by 793
End-to-end available bandwidth: Measurement methodology, dynamics, and relation with TCP throughput
Jain, M., & Dovrolis, C. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.815304 · Cited by 770
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
Measurements and analysis of end-to-end Internet dynamics
Paxson, V. (1997) · doi:10.2172/551971 · Cited by 572
End-to-end Internet packet dynamics
Paxson, V. (1997) · Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/263105.263155 · Cited by 542
TCP Veno: TCP enhancement for transmission over wireless access networks
Fu, C. P., & Liew, S. C. (2003) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2002.807336 · Cited by 536
The impact of multihop wireless channel on TCP throughput and loss
Fu, Z., Zerfos, P., Luo, H., Lu, S., Zhang, L., & Gerla, M. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209197 · Cited by 522
A quantitative comparison of graph-based models for Internet topology
Zegura, E. W., Calvert, K. L., & Donahoo, M. J. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650138 · Cited by 482
An investigation of geographic mapping techniques for internet hosts
Padmanabhan, V. N., & Subramanian, L. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383073 · Cited by 479
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
TIMELY: RTT-based Congestion Control for the Datacenter
Mittal, R., Lam, V. T., Dukkipati, N., Blem, E., Wassel, H., Ghobadi, M., Vahdat, A., Wang, Y., Wetherall, D., & Zats, D. (2015) · Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication · doi:10.1145/2785956.2787510 · Cited by 448
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
DeTail: reducing the flow completion time tail in datacenter networks
Zats, D., Das, T., Mohan, P., Borthakur, D., & Katz, R. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342390 · Cited by 383
General AIMD congestion control
Yang, Y. R., & Lam, S. S. (2002) · Proceedings 2000 International Conference on Network Protocols · doi:10.1109/icnp.2000.896303 · Cited by 370
Binomial congestion control algorithms
Bansal, D., & Balakrishnan, H. (2002) · Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213) · doi:10.1109/infcom.2001.916251 · Cited by 363
TCP ex machina: computer-generated congestion control
Winstein, K., & Balakrishnan, H. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486020 · Cited by 332
TCP-Peach: a new congestion control scheme for satellite IP networks
Akyildiz, I. F., Morabito, G., & Palazzo, S. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929853 · Cited by 302
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
Denial of service resilience in ad hoc networks
Aad, I., Hubaux, J.-P., & Knightly, E. W. (2004) · Proceedings of the 10th annual international conference on Mobile computing and networking · doi:10.1145/1023720.1023741 · Cited by 279
Network Coding Meets TCP: Theory and Implementation
Sundararajan, J. K., Shah, D., Médard, M., Jakubczak, S., Mitzenmacher, M., & Barros, J. (2011) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2093850 · Cited by 277
Proportional differentiated services: delay differentiation and packet scheduling
Dovrolis, C., Stiliadis, D., & Ramanathan, P. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316211 · Cited by 265
TCP-Illinois: A loss- and delay-based congestion control algorithm for high-speed networks
Liu, S., Başar, T., & Srikant, R. (2008) · Performance Evaluation · doi:10.1016/j.peva.2007.12.007 · Cited by 259
Experimental evaluation of BBR congestion control
Hock, M., Bless, R., & Zitterbart, M. (2017) · 2017 IEEE 25th International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2017.8117540 · Cited by 257
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
SABUL: A Transport Protocol for Grid Computing
Gu, Y., & Grossman, R. (2003) · Journal of Grid Computing · doi:10.1023/b:grid.0000037553.18581.3b · Cited by 64
Bayesian packet loss detection for TCP
I'onseca, N., & Crovella, M. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498462 · Cited by 27
TCP-Gvegas with prediction and adaptation in multi-hop ad hoc networks
Jiang, H., Luo, Y., Zhang, Q., Yin, M., & Wu, C. (2017) · Wireless Networks · doi:10.1007/s11276-016-1242-y · Cited by 17
Improve throughput of TCP-Vegas in multihop ad hoc networks
Ding, L., Wang, X., Xu, Y., & Zhang, W. (2008) · Computer Communications · doi:10.1016/j.comcom.2008.03.026 · Cited by 13
Metadata
- Authors
- Brakmo, L. S., O'Malley, S. W., & Peterson, L. L.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 1994-10
- Volume
- 24
- Issue
- 4
- Pages
- 24-35
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2112495447
- Cited by
- 1,198
- References
- 13
- FWCI
- 24.34
- Type
- journal article
- Language
- en
- Open access
- bronze
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.