An Efficient Ip Traceback Through Packet Marking Algorithm Essay
3704 Words15 Pages
AN EFFICIENT IP TRACEBACK THROUGH
PACKET MARKING ALGORITHM
Denial-of-service (DoS) attacks pose an increasing threat to today’s Internet. One major difficulty to defend against Distributed Denial-of-service attack is that attackers often use fake, or spoofed IP addresses as the IP source address. Probabilistic packet marking algorithm (PPM), allows the victim to trace back the appropriate origin of spoofed IP source address to disguise the true origin. In this paper we propose a technique that efficiently encodes the packets than the Savage probabilistic packet marking algorithm and reconstruction of the attack graph. This enhances the reliability of the probabilistic packet marking algorithm.
Denial-of-service, Probabilistic Packet Marking Algorithm, Efficient Probabilistic Packet Marking algorithm, attack graph.
Defending against Denial-of service attacks is far from an exact or complete science. Rate limiting, packet filtering , , , and ICMP traceback , in some cases, help limit the impact of Denial-of-service attacks, but usually only at points where the Denial-of-service attack is consuming fewer resources than that are available. In many cases, the only defense is a reactive one, where the source or sources of an ongoing attack are identified and prevented from continuing the attack.
One major difficulty is to defend against Distributed Denial-of-service attack is that attackers often use fake, or spoofed IP addresses as the IP source address. Therefore, attackers can easily disguise themselves as some other hosts on the Internet. Because of the stateless nature of the
Internet, it is a difficult task to determine or trace the source of these attacker’s packets and there by locate the potential locations of these attackers. This is known as the IP traceback problem. Many IP traceback