The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
TCP Veno: TCP enhancement for transmission over wireless access networks
Abstract
Wireless access networks in the form of wireless local area networks, home networks, and cellular networks are becoming an integral part of the Internet. Unlike wired networks, random packet loss due to bit errors is not negligible in wireless networks, and this causes significant performance degradation of transmission control protocol (TCP). We propose and study a novel end-to-end congestion control mechanism called TCP Veno that is simple and effective for dealing with random packet loss. A key ingredient of Veno is that it monitors the network congestion level and uses that information to decide whether packet losses are likely to be due to congestion or random bit errors. Specifically: (1) it refines the multiplicative decrease algorithm of TCP Reno-the most widely deployed TCP version in practice-by adjusting the slow-start threshold according to the perceived network congestion level rather than a fixed drop factor and (2) it refines the linear increase algorithm so that the connection can stay longer in an operating region in which the network bandwidth is fully utilized. Based on extensive network testbed experiments and live Internet measurements, we show that Veno can achieve significant throughput improvements without adversely affecting other concurrent TCP connections, including other concurrent Reno connections. In typical wireless access networks with 1% random packet loss rate, throughput improvement of up to 80% can be demonstrated. A salient feature of Veno is that it modifies only the sender-side protocol of Reno without changing the receiver-side protocol stack.
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
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
Congestion avoidance and control
Jacobson, V. (1988) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
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
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
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
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
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
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
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
TCP Vegas: new techniques for congestion detection and avoidance
Brakmo, L. S., O'Malley, S. W., & Peterson, L. L. (1994) · Proceedings of the conference on Communications architectures, protocols and applications - SIGCOMM '94 · doi:10.1145/190314.190317 · Cited by 698
Measurements and analysis of end-to-end Internet dynamics
Paxson, V. (1997) · doi:10.2172/551971 · Cited by 572
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
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
Floyd, S. (2000) · doi:10.17487/rfc2914 · Cited by 287
Ongoing TCP Research Related to Satellites
Dawkins, S., Glover, D., Griner, J., Tran, D., Henderson, T., Heidemann, J., Touch, J., Kruse, H., Ostermann, S., Scott, K., et al. (2000) · doi:10.17487/rfc2760 · Cited by 284
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
Hengartner, U., Bolliger, J., & Gross, T. R. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832553 · Cited by 134
A new congestion control scheme
Wang, Z., & Crowcroft, J. (1991) · ACM SIGCOMM Computer Communication Review · doi:10.1145/116030.116033 · Cited by 122
Wireless TCP performance with link layer FEC/ARQ
Chockalingam, A., Zorzi, M., & Tralli, V. (2003) · International Conference on Communications · doi:10.1109/icc.1999.765503 · Cited by 119
TCP Westwood: Bandwidth Estimation for Enhanced Transport over Wireless Links
CASETTI, C. E., Gerla, M., S., M., M., S., & Wang, R. (2002) · PORTO@Iris · Cited by 119
On the effective evaluation of TCP
Allman, M. C., & Falk, A. (1999) · ACM SIGCOMM Computer Communication Review · doi:10.1145/505696.505703 · Cited by 117
Improving TCP congestion control over Internets with heterogeneous transmission media
Parsa, C., & Garcia-Luna-Aceves, J. J. (2005) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.1999.801940 · Cited by 116
Improving TCP performance over wireless networks at the link layer
Parsa, C., & Garcia-Luna-Aceves, J. J. (2003) · Mobile Networks and Applications · doi:10.1023/a:1019131822786 · Cited by 109
TCP HACK: TCP header checksum option to improve performance over lossy links
Balan, R. K., -, B. L., Kumar, K., Jacob, L., Seah, W. K. G., & Ananda, A. L. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2001.916713 · Cited by 60
Use of TCP Decoupling in Improving TCP Performance over Wireless Networks
Wang, S. Y., & Kung, H. T. (2001) · Wireless Networks · doi:10.1023/a:1016669921107 · Cited by 22
Tcp veno: end-to-end congestion control over heterogeneous networks
Fu, C., & Chang, L. S. (2001) · Cited by 19
Self-citation
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
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
(2006) · Springer eBooks · doi:10.1007/1-4020-4711-8 · Cited by 363
TCP in wireless environments: problems and solutions
Tian, Y., Xu, K., & Ansari, N. (2005) · IEEE Communications Magazine · doi:10.1109/mcom.2005.1404595 · Cited by 333
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
- Fu, C. P., & Liew, S. C.
- Venue
- IEEE Journal on Selected Areas in Communications
- Published
- 2003-02
- Volume
- 21
- Issue
- 2
- Pages
- 216-228
- ISSN
- 0733-8716 (ISSN-L)
- OpenAlex
- W2118760020
- Cited by
- 536
- References
- 32
- FWCI
- 34.48
- 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.