Practical network support for IP traceback
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
An analysis of using reflectors for distributed denial-of-service attacks
ACM SIGCOMM Computer Communication Review
Centertrack: an IP overlay network for tracking DoS floods
SSYM'00 Proceedings of the 9th conference on USENIX Security Symposium - Volume 9
Inferring internet denial-of-service activity
SSYM'01 Proceedings of the 10th conference on USENIX Security Symposium - Volume 10
Performance analysis of probabilistic packet marking in IPv6
Computer Communications
Vulnerabilities in distance-indexed IP traceback schemes
International Journal of Security and Networks
A proposal for new marking scheme with its performance evaluation for IP traceback
WSEAS Transactions on Computer Research
IP trace back techniques to ferret out denial of service attack source
ISP'07 Proceedings of the 6th WSEAS international conference on Information security and privacy
Simulation of internet DDoS attacks and defense
ISC'06 Proceedings of the 9th international conference on Information Security
| Hi-index | 0.00 |
The problem of identifying the sources of a denial of service attack is among the hardest in the Internet security area, especially since attackers often use incorrect, or spoofed, source IP addresses. In this paper we present the results from a comparison between some of the most promising traceback techniques proposed to solve this problem. Our goal was to evaluate and analyze the most promising techniques on our way to find a more efficient approach. We have evaluated four different traceback approaches and summarized the results. Our own research was primary targeted at the iTrace approaches while the other approaches were evaluated based on the previous work. We conclude that there are two main disadvantages of the proposed approaches. First, the hop-by-hop path reconstruction is inefficient due to a significant computation overhead, or a long time spent for collecting the samples of the path. Second, the path reconstruction requires changes in the core routing structure that is not profitable. We also suggest a slightly modified version of iTrace approach, which aims at reducing the overhead imposed by such changes.