1Moore D,Paxson V,Savage S,Shannon C,Staniford S,Weaver N.Inside the slammer worm.IEEE Security and Privacy,2003,1(4):33-39.
2Moore D,Shannon C.Code-Red:A case study on the spread and victims of an Internet worm.In:Proc.of the 2002 ACM SICGOMM Internet Measurement Workshop.Marseille,2002.273-284.http://portal.acm.org/citation.cfm?id=637244&dl= ACM&coll=&CFID=15151515&CFTOKEN=6184618
4Singh S,EstanC,Varghese G,Savage S.Automated worm fingerprinting.In:Proc.of the 6th ACM/USENIX Symp.on Operating System Design and Implementation (OSDI).San Francisco,2004.45-60.http://www.usenix.org/events/osdi04/tech/full_papers/ singh/singh.pdf
5Axelsson.Intrusion detection systems:A survey and taxonomy.Technical Report,99-15,Chalmers University,2000.
6Bloom B.Space/Time trade-offs in Hash coding with allowable errors.Communications of the ACM,1970,13(7):422-426.
7Dharmapurikar S,Krishnamurthy P,Sproull T,Lockwood J.Deep packet inspection using parallel Bloom filters.In:Proc.of the Symp.on High Performance Interconnects (HotI).Stanford,2003.44-51.http://www.hoti.org/archive/Hoti11_program/papers/ hoti11_07_dharmapurikar_s.pdf
8Dharmapurikar S,Attig M,Lockwood J.Design and implementation of a string matching system for network intrusion detection using FPGA-based Bloom filters.Technical Report,WUCSE-2004-12,St.Louis:Washington University,2004.
9Song HY,Dharmapurikar S,Turner J,Lockwood J.Fast hash table lookup using extended Bloom filter:An aid to network processing.In:Proc.of the ACM SIGCOMM 2005.Philadelphia,2005.20-26.http://portal.acm.org/citation.cfm?id=1080114&dl= ACM&coll=&CFID=15151515&CFTOKEN=6184618
10Yu F,Katz RH,Lakshman TV.Gigabit rate packet pattern-matching using TCAM.In:Proc.of the 12th IEEE Int'l Conf.on Network Protocols (ICNP 2004).Berlin,2004.174-183.http://portal.acm.org/citation.cfm?id=1025890&dl=GUIDE&coll=GUIDE
