期刊文献+

随机伪造源地址分布式拒绝服务攻击过滤 被引量:3

Random Spoofed Source Address Distributed Denial-of-Service Attack Traffic Filter
下载PDF
导出
摘要 由于能够有效隐藏攻击者,随机伪造源地址分布式拒绝服务攻击被广泛采用.抵御这种攻击的难点在于无法有效区分合法流量和攻击流量.基于此类攻击发生时攻击包源地址的统计特征,提出了能够有效区分合法流量和攻击流量,并保护合法流量的方法.首先设计了一种用于统计源地址数据包数的高效数据结构Extended Counting Bloom Filter(ECBF),基于此,提出了随机伪造源地址分布式拒绝服务攻击发生时合法地址识别算法.通过优先转发来自合法地址的数据包,实现对合法流量的有效保护.采用真实互联网流量进行模拟,实验结果表明,所提方法能精确识别合法地址,有效地保护合法流量,尤其能够较好地保护有价值的交易会话.所提方法的时间复杂性为O(1),并且只需数兆字节的内存开销,可嵌入边界路由器或网络安全设备,如防火墙中,实现随机伪造源地址分布式拒绝服务攻击的在线过滤. Distributed Denial-of-Service (DDoS) attack, using random spoofed source addresses, is popular because it can protect the attacker's anonymity. It is very difficult to defent against this attack because it is very hard to differentiate bad traffic from the normal. In this paper, based on the source addresses distribution statistical feature, an effective defense scheme, which can differentiate vicious traffic from normal traffic, is presented. Based on a novel Extended Counting Bloom Filter (ECBF) data structure, this paper proposes an algorithm to identify normal addresses accurately. Once a normal address is sought out, packets from it will be forwarded with high priority, thus, normal traffic is protected. The simulation results show that this scheme can identify legitimate addresses accurately, protect legitimate traffic effectively, and give better protection to valuable long flows. Because the time complexity of the method is O(1), and it needs several MB memory space, it can be implemented in edge routers or network secure devices like firewalls to defend against random spoofed source address DDoS attacks.
出处 《软件学报》 EI CSCD 北大核心 2011年第10期2425-2437,共13页 Journal of Software
基金 国家自然科学基金(60703021 61070185) 国家高技术研究发展计划(863)(2007AA010501 2007AA01Z444)
关键词 网络安全 分布式拒绝服务攻击 BLOOM FILTER 随机伪造源地址 network security distributed denial of service Bloom Filter random spoofed source address
  • 相关文献

参考文献2

二级参考文献26

  • 1王叔子.时间序列分析的工程应用[M].武汉:华中理工大学出版社,1992..
  • 2杜金观 项静怡 等.时间序列分析--建模与预报[M].合肥:安徽教育出版社,1991.79-98.
  • 3Postel J.Transmission control protocol,RFC793.Internet Society,1981.
  • 4Koloniari K,Pitoura E.Bloom filters for hierarchical data.In:Proc.of the 5th Int'l Workshop on Distributed Data and Structures (WDAS).2003.
  • 5Bernard C,Joe K,Ronitt R,Ayellet T.The bloomier filter:An efficient data structure for static support lookup tables.In:Proc.of the 15th Annual ACM-SIAM Symp.on Discrete Algorithms Table of Contents.Philadelphia:Society for Industrial and Applied Mathematics,2004.30-39.
  • 6Little MC,Speirs NA,Shrivastava SK.Using bloom filters to speed-up name lookup in distributed systems.The Computer Journal,2002,45(6):645-652.
  • 7Chin-Chen C,Tian-Fu L,Jyh-Jong L.Partition search filter and its performance analysis.Journal of Systems and Software,1999,47(1):35-43.
  • 8Sarang D,Praveen K,David ET.Longest prefix matching using bloom filters.In:Proc.of the Conf.on SIGCOMM.New York:ACM Press,2003.201-212.
  • 9Andrei B,Michael M.Network applications of bloom filters:A survey.Internet Mathematics,2003,1(4):485-509.
  • 10Kohler E,Li JY,Paxson V,Shenker S.Observed structure of addresses in IP traffic.In:Internet Measurement Workshop 2002.New York:ACM Press,2002.253-266.

共引文献129

同被引文献44

  • 1Burton H B.Space/time trade-offs in hash coding with allowable errors[J].Communications of the ACM, 1970, 13(7) :422-426.
  • 2Broder A, Mitzenmacher M.Network applications of Bloom filters: a survey[J].Intemet Mathematics, 2005, 1(4):485-509.
  • 3Dharmapurikar S, Krishnamurthy P, Taylor D.Longest prefix matching using Bloom filters[J].IEEE-ACM Transactions on Networking, 2006,14 (2) : 397-409.
  • 4Dharmapurikar S, Krishnamurthy P, Sproull T, et al. Deep packet inspection using parallel Bloom filters[C]// The llth Symposium on High Performance Interconnects. Piscataway,NJ:IEEE Computer Society,2003:44-51.
  • 5Reynolds P, Vahdat A.Efficient peer-to-peer keyword searching[C]//Endler M, Schmidt D.Lecture Notes in Computer Science: Middleware 2003.Berlin Heidelberg: Springer-Verlag, 2003 : 21-40.
  • 6Pang M, Xu G.A personalized search engine research based on Bloom filter[C]//2011 International Conference on Electric Engineering and Computer(MEC), 2011: 2365-2368.
  • 7Kumar A, Xu J, Zegura E W.Efficient and scalable query routing for unstructured peer-to-peer networks[C]//INFO- COM 2005, Miami, FL.Washington: IEEE Computer Society, 2005 : 1162-1173.
  • 8Byers J, Considine J, Mitzenmacher M, et al.Informed content delivery across adaptive overlay networks[J]. ACM SIGCOMM Computer Communication Review, 2002,32(4) :47-60.
  • 9Minsky Y, Trachtenberg A, Zippel R.Set reconciliation with nearly optimal communication complexity[J].IEEE Transactions on Information Theory, 2003, 49 (9) : 2213-2218.
  • 10Starobinski D, Trachtenberg A, Agarwal S.Efficient PDA synchronization[J].IEEE Transactions on Mobile Computing, 2003,2( 1 ) :40-51.

引证文献3

二级引证文献10

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部