作　　者： ; ;

机构地区： 深圳大学计算机与软件学院

出　　处： 《计算机应用》 2012年第10期2757-2760,共4页

摘　　要： 概率包标记(PPM)算法是防御分布式拒绝服务攻击(DDoS)的重要方法,针对PPM因为重复标记而存在最弱链和弱收敛性问题,以及因为分片问题而导致重构路径时计算量大等问题,提出一种基于路由器接口(IDnumber)的一致概率包标记算法———IDCPPM,该算法使每个路由器的标记信息都能以一致的概率到达受害者,且由于不用分片,因而有效地减少了重构路径时所需要接受包的数量,降低了算法的复杂度,并且新方案能扩展到IPv6中。理论分析和实验仿真证明了该方法的有效性。 Probabilistic Packet Marking （PPM） algorithm is an important method to prevent the Distributed Denial of Service （DDoS） attacks. But it has the weakest chain and the weak convergence of issues because of the repeated marking, as well as large amount of computation because of the fragmentation problem when reconstructing the path. A new marking algorithm -- IDCPPM was proposed which was based on router interface （ID number） with a consistency probability. The algorithm enabled the marking information to reach the victims with a consistency probability . For its non-fragmentation, it effectively reduced the number of packets needed to reconstruct the path and reduce the complexity of the algorithm. Also it can be applied to IPv6. The theoretical analysis and experimental results prove the effectiveness of this method.

关 键 词： 追踪 概率包标记 最弱链 弱收敛性 分布式拒绝服务

领　　域： [自动化与计算机技术] [自动化与计算机技术]