The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
Abstract
TCP congestion control has been designed to ensure Internet stability along with fair and efficient allocation of the network bandwidth. During the last decade, many congestion control algorithms have been proposed to improve the classic Tahoe/Reno TCP congestion control. This paper aims at evaluating and comparing three control algorithms, which are Westwood+, New Reno and Vegas TCP, using both Ns-2 simulations and live Internet measurements. Simulation scenarios are carefully designed in order to investigate goodput, fairness and friendliness provided by each of the algorithms. Results show that Westwood+ TCP is friendly towards New Reno TCP and improves fairness in bandwidth allocation whereas Vegas TCP is fair but it is not able to grab its bandwidth share when coexisting with Reno or in the presence of reverse traffic because of its RTT-based congestion detection mechanism. Finally results show that Westwood+ remarkably improves utilization of wireless links that are affected by losses not due to congestion.
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
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
The Art of Computer Systems Performance Analysis.
Jain, R. (1990) · Int. CMG Conference · Cited by 2,280
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
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 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
Promoting the use of end-to-end congestion control in the Internet
Floyd, S., & Fall, K. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.793002 · Cited by 1,646
A comparison of mechanisms for improving TCP performance over wireless links
Balakrishnan, H., Padmanabhan, V. N., Seshan, S., & Katz, R. H. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650137 · Cited by 1,395
Rossenwasser, E. N., & Lampe, B. P. (2000) · Communications and Control Engineering · doi:10.1007/978-1-4471-0521-3 · Cited by 1,150
The art of computer systems performance analysis
Chlamtac, I. (1992) · Journal of Molecular Graphics · doi:10.1016/0263-7855(92)80055-i · Cited by 1,020
TCP Selective Acknowledgment Options
Mathis, M., Mahdavi, J., Floyd, S., & Romanow, A. (1996) · doi:10.17487/rfc2018 · Cited by 972
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
TCP westwood: Bandwidth estimation for enhanced transport over wireless links
Mascolo, S., Casetti, C., Gerla, M., Sanadidi, M. Y., & Wang, R. (2001) · Proceedings of the 7th annual international conference on Mobile computing and networking · doi:10.1145/381677.381704 · Cited by 921
Self-citationDummynet: 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
Stevens, W. R. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 766
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
Difficulties in simulating the Internet
Floyd, S., & Paxson, V. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.944338 · Cited by 721
The design philosophy of the DARPA internet protocols
Clark, D. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52336 · Cited by 655
Perdikaris, G. A. (1991) · Computer Controlled Systems · doi:10.1007/978-94-015-7929-2_6 · Cited by 504
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
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
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
Pahdye, J., & Floyd, S. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383083 · Cited by 199
Morris, R. (2002) · Proceedings 1997 International Conference on Network Protocols · doi:10.1109/icnp.1997.643715 · Cited by 163
On the effective evaluation of TCP
Allman, M. C., & Falk, A. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505696.505703 · Cited by 129
Explicit transport error notification (ETEN) for error-prone wireless and satellite networks
Krishnan, R., Sterbenz, J. P. G., Eddy, W. M., Partridge, C., & Allman, M. C. (2004) · Computer Networks · doi:10.1016/j.comnet.2004.06.012 · Cited by 89
TCP Westwood and Easy RED to Improve Fairness in High-Speed Networks
Grieco, L. A., & Mascolo, S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-47828-0_9 · Cited by 74
Self-citationEnd-to-End Bandwidth Estimation for Congestion Control in Packet Networks
Grieco, L. A., & Mascolo, S. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36480-3_47 · Cited by 29
Self-citationAdditive increase early adaptive decrease mechanism for TCP congestion control
Mascolo, S., & Grieco, L. A. (2003) · doi:10.1109/ictel.2003.1191514 · Cited by 9
Self-citation
Cited by
Cabernet: vehicular content delivery using WiFi
Eriksson, J., Balakrishnan, H., & Madden, S. (2008) · Proceedings of the 14th ACM international conference on Mobile computing and networking · doi:10.1145/1409944.1409968 · Cited by 427
Host-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
Metadata
- Authors
- Grieco, L. A., & Mascolo, S.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2004-04
- Volume
- 34
- Issue
- 2
- Pages
- 25-38
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2150339484
- Cited by
- 293
- References
- 30
- FWCI
- 27.49
- 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.