The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Low-rate TCP-targeted denial of service attacks: the shrew vs. the mice and elephants
Abstract
Denial of Service attacks are presenting an increasing threat to the global inter-networking infrastructure. While TCP's congestion control algorithm is highly robust to diverse network conditions, its implicit assumption of end-system cooperation results in a well-known vulnerability to attack by high-rate non-responsive flows. In this paper, we investigate a class of low-rate denial of service attacks which, unlike high-rate attacks, are difficult for routers and counter-DoS mechanisms to detect. Using a combination of analytical modeling, simulations, and Internet experiments, we show that maliciously chosen low-rate DoS traffic patterns that exploit TCP's retransmission time-out mechanism can throttle TCP flows to a small fraction of their ideal rate while eluding detection. Moreover, as such attacks exploit protocol homogeneity, we study fundamental limits of the ability of a class of randomized time-out mechanisms to thwart such low-rate DoS attacks.
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
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290 · cited 1×
“Synchronization of TCP flows was extensively explored in [10, 31] and was one of the main motivations for RED [11], whose goal is the avoidance of synchronization of many TCP flows decreasing their window at the same time.”
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
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
End-to-end Internet packet dynamics
Paxson, V. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.779192 · Cited by 908
Computing TCP's Retransmission Timer
Paxson, V., Allman, M., Chu, J., & Sargent, M. (2011) · doi:10.17487/rfc6298 · Cited by 825
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
New directions in traffic measurement and accounting
Estan, C., & Varghese, G. (2001) · doi:10.1145/505202.505212 · Cited by 734
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Kent, S. T., & Strayer, W. T. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383060 · Cited by 733
Cited by
Defense Against Spoofed IP Traffic Using Hop-Count Filtering
Wang, H., Jin, C., & Shin, K. G. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.890133 · Cited by 374
Perez-Diaz, J. A., Valdovinos, I. A., Choo, K.-K. R., & Zhu, D. (2020) · IEEE Access · doi:10.1109/access.2020.3019330 · Cited by 309
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
Self-citationADAM: An adaptive DDoS attack mitigation scheme in software-defined cyber-physical system
Cai, T., Jia, T., Adepu, S., Li, Y., & Yang, Z. (2023) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2023.3240586 · Cited by 73
“So far, there are many ways of DDoS attacks and they are increasing, such as TCP SYN flood attack [16], ICMP flood attack [17], amplification attack [18], application-layer DDoS attack [19], low-rate DoS attack [20], link flooding attack [21], etc.”
Background
Metadata
- Authors
- Kuzmanovic, A., & Knightly, E. W.
- Venue
- Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
- Publisher
- ACM
- Published
- 2003-08-25
- Pages
- 75-86
- OpenAlex
- W2130583399
- Cited by
- 489
- References
- 26
- FWCI
- 11.30
- 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.