检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《计算机应用》2005年第9期2092-2093,2097,共3页journal of Computer Applications
摘 要:防御分布式拒绝服务攻击是当前网络安全中最难解决的问题之一。在各种解决方法中,自适应概率包标记受到了广泛的重视,因为算法中路径上的每个路由器根据一定策略自适应的概率标记过往的数据包,从而受害者可以用最短的重构时间,对攻击者进行IP回溯,找出攻击路径并发现攻击源。文中提出了一种自适应的标记策略。通过实验验证相比于常用策略,该策略重构路径所需的数据包明显减少,有效地减少了重构计算量和伪证性。Defending against distributed denial of service attacks is one of the hardest security problems on the Internet today. Among several countermeasures, adaptive probabilistic packet making(APPM) is promising. Every router marks a passing packet with a probability that is adaptive to a given strategy, so that a minimum convergence time for an attacking path can be achieved to the victim, and the victim can be found in attack path reconstruction using IP traeeback method. In this paper, an adaptive probabilistic packet malting scheme was given. Compared to common schemes, it reduced the number of packets needed for path reconstruction, and the computation overhead and false proofs in path reconstruction were effectively reduced.
关 键 词:网络安全 分布式拒绝服务攻击 自适应概率包标记:IP回溯
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.189.30.7