Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication 2000
DOI: 10.1145/347059.347560
|View full text |Cite
|
Sign up to set email alerts
|

Practical network support for IP traceback

Abstract: This paper describes a technique for tracing anonymous packet flooding attacks in the Internet back towards their source. This work is motivated by the increased frequency and sophistication of denial-of-service attacks and by the difficulty in tracing packets with incorrect, or "spoofed", source addresses. In this paper we describe a general purpose traceback mechanism based on probabilistic packet marking in the network. Our approach allows a victim to identify the network path(s) traversed by attack traffic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
480
0
8

Year Published

2004
2004
2020
2020

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 469 publications
(489 citation statements)
references
References 14 publications
1
480
0
8
Order By: Relevance
“…DDoS attack detection can be done in various ways such as, Pattern Detection [6], Anomaly Detection [7], Third party detection [8] and Packet Marking [9] etc. For example in [10] The Ganguly et al [14] proposed a solution for detection of DDoS attack, our proposed solution is an extension of Ganguly et al work.…”
Section: Prior Work For Detection Of Ddos Attackmentioning
confidence: 99%
“…DDoS attack detection can be done in various ways such as, Pattern Detection [6], Anomaly Detection [7], Third party detection [8] and Packet Marking [9] etc. For example in [10] The Ganguly et al [14] proposed a solution for detection of DDoS attack, our proposed solution is an extension of Ganguly et al work.…”
Section: Prior Work For Detection Of Ddos Attackmentioning
confidence: 99%
“…Savage [9] uses the method of statistics to define the function, which means the expected result of the number of marked packets. Let i be the current hops count of the packet, p be the marking probability which the value is 0.04, f be the number of fragments where f is greater than 1, d be the attack path, X be the number of packets and E(X) be the expected number of packets required to reconstruct attack paths.…”
Section: B Scheme Comparisonmentioning
confidence: 99%
“…In a marking-based scheme, e.g., probabilistic packet marking (PPM) [9,21], intermediate nodes (probabilistically) mark the packets being forwarded with partial path information, which later on allows a receiver to reconstruct the forwarding path given a modest number of the marked packets.…”
Section: Marking-based Schemesmentioning
confidence: 99%