摘要：

针对压缩边分片采样算法复杂度和重构路径误报率过高的问题，提出一种改进的压缩边分片采样概率包标记方法，即重叠哈希分片(OHF)的概率包标记方法。该方法在不增加包标记位的前提下，通过构造相邻的IP哈希分片之间的4位哈希关系，降低重构算法复杂度，同时改善边采样误报率。在NS2环境下的仿真实验表明了OHF方法的有效性。

关键词: IP追踪, 概率包标记, 动态概率包标记, 压缩边分片采样, 分布式拒绝服务

Abstract:

Aiming at the shortcoming of the compressed edge fragment sampling algorithm, a new method is proposed, called Overlapping Hash Fragment(OHF) Probabilistic Packet Marking(PPM) method. The new method reduces the computational complexity during reconstruction by constructing 4 bits hash relationship between the adjacent IP fragments without increasing the marking amounts. And the new method improves the false alarm rate. Simulation experiment in the NS2 show the validity of the method.

Key words: IP traceback, Probabilistic Packet Marking(PPM), Dynamic Probabilistic Packet Marking(DPPM), compressed edge fragment sampling, Distributed Denial of Service(DDoS)

中图分类号: 

• TP393.08