摘要
拒绝服务攻击由于其高发性、大危害、难防范而成为因特网上的一大难题.研究人员为此提出了各种各样的对策,其中概率包标记具有较大的潜力.然而,现有的标记方案都存在各种各样的缺点.提出了一个新的标记方案,与其他标记方法相比,该方案具有反映灵敏、误报率低和计算量小的优点.此外,该方法还限制了攻击者伪造追踪信息的能力.
DDoS attack represents a big problem to the Internet community for its high profile, severe damage, and difficult defending. Several countermeasures are proposed for it in the literature, among which, Probabilistic Packet Marking （PPM） is promising. However, all the existing marking schemes are bearing limitations in some aspects. In this paper, a new packet marking scheme is proposed, which is more prompt because of fewer packets needed, more scalable and more efficient in computation compared with other schemes. Furthermore, this scheme limits attackers＇ ability in spoofing trace message.
出处
《软件学报》
EI
CSCD
北大核心
2007年第10期2652-2661,共10页
Journal of Software
基金
Supported by the National High-Tech Research and Development Plan of China under Grant Nos.2006AA01Z412, 2006AA01Z437, 2006AA01Z433 (国家高技术研究发展计划(863))
关键词
网络安全
追踪
拒绝服务
分布式拒绝服务
network security
traceback
DoS （denial of service）
DDoS （distributed denial of service）
