Probabilistic Route Selection Algorithm for IP Traceback
DoS(Denial of Service) or DDoS(Distributed DoS) attack is a major threaten and the most difficult problem to solve among many attacks. Moreover, it is very difficult to find a real origin of attackers because DoS/DDoS attacker uses spoofed IP addresses. To solve this problem, we propose a probabilis...
Saved in:
Published in | Security Technology, Disaster Recovery and Business Continuity Vol. 122; pp. 94 - 103 |
---|---|
Main Authors | , |
Format | Book Chapter |
Language | English |
Published |
Germany
Springer Berlin / Heidelberg
2010
Springer Berlin Heidelberg |
Series | Communications in Computer and Information Science |
Subjects | |
Online Access | Get full text |
ISBN | 3642176097 9783642176098 |
ISSN | 1865-0929 1865-0937 |
DOI | 10.1007/978-3-642-17610-4_11 |
Cover
Summary: | DoS(Denial of Service) or DDoS(Distributed DoS) attack is a major threaten and the most difficult problem to solve among many attacks. Moreover, it is very difficult to find a real origin of attackers because DoS/DDoS attacker uses spoofed IP addresses. To solve this problem, we propose a probabilistic route selection traceback algorithm, namely PRST, to trace the attacker’s real origin. This algorithm uses two types of packets such as an agent packet and a reply agent packet. The agent packet is in use to find the attacker’s real origin and the reply agent packet is in use to notify to a victim that the agent packet is reached the edge router of the attacker. After attacks occur, the victim generates the agent packet and sends it to a victim’s edge router. The attacker’s edge router received the agent packet generates the reply agent packet and send it to the victim. The agent packet and the reply agent packet is forwarded refer to probabilistic packet forwarding table (PPFT) by routers. The PRST algorithm runs on the distributed routers and PPFT is stored and managed by routers. We validate PRST algorithm by using mathematical approach based on Poisson distribution. |
---|---|
ISBN: | 3642176097 9783642176098 |
ISSN: | 1865-0929 1865-0937 |
DOI: | 10.1007/978-3-642-17610-4_11 |