Performance Improvement of PPM Algorithm
B Pramila, G. Arunkumar, N. Jagadisha · 2012
While Denial-of-Service (DoS) attack technology continues to evolve, the circumstances enabling attacks have not significantly changed in recent years. DoS attacks remain a serious threat to the users, organizations, and infrastructures of the Internet. The research work highlights the usage of probabilistic packet marking (PPM) algorithm which is a promising way to discover the Internet map or an attack path that the attack packets traversed during a distributed denial-of-service attack. But it has been seen that its termination condition is not well defined which results in incorrect attack path constructed by the PPM algorithm. In this research work, a novel approach for a precise termination condition named as rectified PPM (RPPM) algorithm. The most significant merit of the RPPM algorithm is that when the algorithm terminates, the algorithm guarantees that the constructed attack path is correct, with a specified level of confidence. An experimental framework is designed on the RPPM algorithm and show that the RPPM algorithm can guarantee the correctness of the constructed attack path under different probabilities that a router marks the attack packets and different structures.