| 非强制性包标记算法 |
| |
| 引用本文： | 顾晓清,倪彤光,刘渊.非强制性包标记算法[J].计算机工程与应用,2007,43(5):140-142. |
| |
| 作者姓名： | 顾晓清 倪彤光 刘渊 |
| |
| 作者单位： | 江苏工业学院计算机科学与工程系，江苏工业学院计算机科学与工程系，江南大学信息工程学院 江苏常州213016 江南大学信息工程学院，江苏无锡214122，江苏常州213016，江苏无锡214122 |
| |
| 摘 要： | 防御分布式拒绝服务(DDoS)攻击是目前最难处理的网络安全问题之一。在众多解决方法中,包标记方法受到了广泛的重视。在这类标记方案中,路径中的路由器根据一定策略标记过往的数据包,从而受害者可以在短时间内对攻击路径进行重构,实现对攻击者的IP回溯。论文提出了一种新的包标记方法,非强制性包标记算法。可以有效地降低重构时间和误报率,减少了网络和路由器标记数据包的负担。
|
| 关 键 词： | 网络安全 分布式拒绝服务攻击 包标记 IP回溯 |
| 文章编号： | 1002-8331（2007）05-0140-03 |
| 修稿时间： | 2006-05 |
Non-preemptive packet marking scheme |
| |
| GU Xiao-qing,NI Tong-guang,LIU Yuan.Non-preemptive packet marking scheme[J].Computer Engineering and Applications,2007,43(5):140-142. |
| |
| Authors: | GU Xiao-qing NI Tong-guang LIU Yuan |
| |
| Affiliation: | 1.Department of Computer Science and Technology,Jiangsu Polytechnic University,Changzhou,Jiangsu 213016,China; 2.School of Information Technology,Southern Youngtze University,Wuxi,Jiangsu 214122,China |
| |
| Abstract: | Distributed Denial of Service(DDoS) attack is among the hardest network problems.Among several countermeasures,packet making scheme is promising.In these marking schemes,every router marks a passing packet with a probability,so that the convergence time for an attacking path can be achieved in little time,and the attack can be found in attack path reconstruction using IP traceback.In this paper,a new packet making scheme,a non-preemptive packet marking scheme is given,which reduces the convergence time and false positive rate,and takes lower network and router overhead. |
| |
| Keywords: | network security Distributed Denial of Service attacks packet making IP traceback |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
