The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
TCP westwood: Bandwidth estimation for enhanced transport over wireless links
Abstract
TCP Westwood (TCPW) is a sender-side modification of the TCP congestion window algorithm that improves upon the performance of TCP Reno in wired as well as wireless networks. The improvement is most significant in wireless networks with lossy links, since TCP Westwood relies on end-to-end bandwidth estimation to discriminate the cause of packet loss (congestion or wireless channel effect) which is a major problem in TCP Reno. An important distinguishing feature of TCP Westwood with respect to previous wireless TCP “extensions” is that it does not require inspection and/or interception of TCP packets at intermediate (proxy) nodes. Rather, it fully complies with the end-to-end TCP design principle. The key innovative idea is to continuously measure at the TCP source the rate of the connection by monitoring the rate of returning ACKs. The estimate is then used to compute congestion window and slow start threshold after a congestion episode, that is, after three duplicate acknowledgments or after a timeout. The rationale of this strategy is simple: in contrast with TCP Reno, which “blindly” halves the congestion window after three duplicate ACKs, TCP Westwood attempts to select a slow start threshold and a congestion window which are consistent with the effective bandwidth used at the time congestion is experienced. We call this mechanism faster recovery. The proposed mechanism is particularly effective over wireless links where sporadic losses due to radio channel problems are often misinterpreted as a symptom of congestion by current TCP schemes and thus lead to an unnecessary window reduction. Experimental studies reveal improvements in throughput performance, as well as in fairness. In addition, friendliness with TCP Reno was observed in a set of experiments showing that TCP Reno connections are not starved by TCPW connections. Most importantly, TCPW is extremely effective in mixed wired and wireless networks where throughput improvements of up to 550% are observed. Finally, TCPW performs almost as well as localized link layer approaches such as the popular Snoop scheme, without incurring the O/H of a specialized link layer protocol.
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) · ACM SIGCOMM Computer Communication Review · doi:10.1145/52325.52356 · Cited by 1,955
Computer Networking: A Top-Down Approach Featuring the Internet
Kurose, J. F., & Ross, K. W. (2000) · Cited by 1,628
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
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
Perdikaris, G. A. (1991) · Springer eBooks · doi:10.1007/978-94-015-7929-2 · Cited by 700
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
Hengartner, U., Bolliger, J., & Gross, T. R. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832553 · Cited by 134
Stochastic modeling of TCP over lossy links
Abouzeid, A. A., Roy, S., & Azizoglu, M. (2002) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2000.832572 · Cited by 93
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
CRAHNs: Cognitive radio ad hoc networks
Akyildiz, I. F., Lee, W.-Y., & Chowdhury, K. R. (2009) · Ad Hoc Networks · doi:10.1016/j.adhoc.2009.01.001 · Cited by 1,345
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
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
End-to-end differentiation of congestion and wireless losses
Cen, S., Cosman, P. C., & Voelker, G. M. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818187 · Cited by 354
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
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
A survey of secure mobile Ad Hoc routing protocols
Abusalah, L., Khokhar, A., & Guizani, M. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2008.080405 · Cited by 311
Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control
Grieco, L. A., & Mascolo, S. (2004) · ACM SIGCOMM Computer Communication Review · doi:10.1145/997150.997155 · Cited by 293
Self-citationATP: a reliable transport protocol for ad hoc networks
Sundaresan, K., Anantharaman, V., Hsieh, H.-Y., & Sivakumar, A. R. (2005) · IEEE Transactions on Mobile Computing · doi:10.1109/tmc.2005.81 · Cited by 287
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
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
ATL: An Adaptive Transport Layer Suite for Next-Generation Wireless Internet
Akan, O. B., & Akyildiz, I. F. (2004) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.826919 · Cited by 75
“TCP-ATL is shown to significantly improve the throughput performance over Snoop (with TCP-Sack) [3] and TCP-Westwood [ 6 ] for WLAN environments, WTCP [25] and TCP-Westwood [6] for wide-area 3G cellular, and TCP-Peach+ [1], [2] and TCP-Westwood [6] for satellite environments.”
BackgroundMethodInfluentialLearning-Based and Data-Driven TCP Design for Memory-Constrained IoT
Li, W., Zhou, F., Meleis, W., & Chowdhury, K. (2016) · 2016 International Conference on Distributed Computing in Sensor Systems (DCOSS) · doi:10.1109/dcoss.2016.8 · Cited by 29
Badarla, V., & Murthy, C. S. R. (2011) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2010.12.012 · Cited by 12
“Note that we do not use iat for estimating the effective bandwidth as in TCP-Westwood [21] which is proposed to enhance the TCP performance in last-hop wireless networks.”
MethodA novel learning based solution for efficient data transport in heterogeneous wireless networks
Badarla, V., & Siva Ram Murthy, C. (2010) · Wireless Networks · doi:10.1007/s11276-009-0228-4 · Cited by 6
Metadata
- Authors
- Mascolo, S., Casetti, C., Gerla, M., Sanadidi, M. Y., & Wang, R.
- Venue
- Proceedings of the 7th annual international conference on Mobile computing and networking
- Publisher
- ACM
- Published
- 2001-07-16
- Pages
- 287-297
- ISSN
- 1543-5679 (ISSN-L)
- OpenAlex
- W2021085547
- Cited by
- 921
- References
- 13
- FWCI
- 21.68
- Type
- conference paper
- 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.