메뉴 건너뛰기




Volumn , Issue , 2009, Pages 2437-2445

Adaptive early packet filtering for defending firewalls against DoS attacks

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN EXPRESSIONS; DATA NETWORK; DEFENSE POLICY; DOS ATTACKS; FILTERING MECHANISM; FILTERING METHOD; FILTERING PROCESS; FILTERING RULES; INTERNET TRAFFIC; INTRUSION DETECTION AND PREVENTION SYSTEMS; LIGHT WEIGHT; PACKET FILTERING; PROCESSING POWER; TIME COST; TRAFFIC BEHAVIOR; WORST CASE;

EID: 70349659341     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062171     Document Type: Conference Paper
Times cited : (55)

References (27)
  • 1
    • 70349700335 scopus 로고    scopus 로고
    • Buddy: Bdd c++ package. "http://sourceforge.net/projects/ buddy", 2006.
    • (2006) Buddy: Bdd c++ package
  • 3
    • 0042976157 scopus 로고    scopus 로고
    • Packet classification for core routers: Is there an alternative to cams
    • F. Baboescu, S. Singh, and G. Varghese. Packet classification for core routers: Is there an alternative to cams. In IEEE INFOCOM'03, 2003.
    • (2003) IEEE INFOCOM'03
    • Baboescu, F.1    Singh, S.2    Varghese, G.3
  • 5
    • 0030246260 scopus 로고    scopus 로고
    • Improving the variable ordering of obdds is np-complete
    • Beate Bollig and Ingo Wegener. Improving the variable ordering of obdds is np-complete. IEEE Trans. Comput., 45(9):993-1002, 1996.
    • (1996) IEEE Trans. Comput , vol.45 , Issue.9 , pp. 993-1002
    • Bollig, B.1    Wegener, I.2
  • 7
    • 36349032847 scopus 로고    scopus 로고
    • Wire speed packet classification without tcams: A few more registers (and a bit of logic) are enough
    • Qunfeng Dong, Suman Banerjee, Jia Wang, and Dheeraj Agrawal. Wire speed packet classification without tcams: a few more registers (and a bit of logic) are enough. SIGMETRICS Perform. Eval. Rev., 35(1):253-264, 2007.
    • (2007) SIGMETRICS Perform. Eval. Rev , vol.35 , Issue.1 , pp. 253-264
    • Dong, Q.1    Banerjee, S.2    Wang, J.3    Agrawal, D.4
  • 8
    • 33749044427 scopus 로고    scopus 로고
    • Policy segmentation for intelligent firewall testing
    • November
    • A. El-Atawy, K. Ibrahim, H. Hamed, and E. Al-Shaer. Policy segmentation for intelligent firewall testing. In NPSec, November 2005.
    • (2005) NPSec
    • El-Atawy, A.1    Ibrahim, K.2    Hamed, H.3    Al-Shaer, E.4
  • 9
    • 34548314604 scopus 로고    scopus 로고
    • On using online traffic statistical matching for optimizing packet filtering performance
    • May
    • A. El-Atawy, T. Samak, E. Al-Shaer, and H. Li. On using online traffic statistical matching for optimizing packet filtering performance. In IEEE INFOCOM'07, May 2007.
    • (2007) IEEE INFOCOM'07
    • El-Atawy, A.1    Samak, T.2    Al-Shaer, E.3    Li, H.4
  • 12
    • 70349701850 scopus 로고    scopus 로고
    • David Goldsmith and Michael Schiffman. Firewalking: A traceroute-like analysis of ip packet responses to determine gateway access control lists, http://www.packetfactory.net/firewalk/firewalk-final.html. White paper, Cambridge Technology Partners, October 1998.
    • David Goldsmith and Michael Schiffman. Firewalking: A traceroute-like analysis of ip packet responses to determine gateway access control lists, http://www.packetfactory.net/firewalk/firewalk-final.html. White paper, Cambridge Technology Partners, October 1998.
  • 13
    • 0035278163 scopus 로고    scopus 로고
    • Algorithms for packet classification
    • P. Gupta and N. McKeown. Algorithms for packet classification. IEEE Network, 15(2):24-32, 2001.
    • (2001) IEEE Network , vol.15 , Issue.2 , pp. 24-32
    • Gupta, P.1    McKeown, N.2
  • 14
    • 33749829094 scopus 로고    scopus 로고
    • Packet classification using hierarchical intelligent cuttings
    • August
    • P. Gupta and N. McKeown. Packet classification using hierarchical intelligent cuttings. In Interconnects VII, August 1999.
    • (1999) Interconnects VII
    • Gupta, P.1    McKeown, N.2
  • 15
    • 0033885345 scopus 로고    scopus 로고
    • Near optimal routing lookups with bounded worst case performance
    • P. Gupta, B. Prabhakar, and S. Boyd. Near optimal routing lookups with bounded worst case performance. In IEEE INFOCOM'00, 2000.
    • (2000) IEEE INFOCOM'00
    • Gupta, P.1    Prabhakar, B.2    Boyd, S.3
  • 16
    • 39049096178 scopus 로고    scopus 로고
    • Adaptive statistical optimization techniques for firewall packet filtering
    • April
    • H. Hamed, A. El-Atawy, and E. Al-Shaer. Adaptive statistical optimization techniques for firewall packet filtering. In IEEE INFOCOM'06, April 2006.
    • (2006) IEEE INFOCOM'06
    • Hamed, H.1    El-Atawy, A.2    Al-Shaer, E.3
  • 22
    • 0027222524 scopus 로고
    • Fast routing table lookup using CAMs
    • March
    • A. J. McAulay and P. Francis. Fast routing table lookup using CAMs. In IEEE INFOCOM'93, March 1993.
    • (1993) IEEE INFOCOM'93
    • McAulay, A.J.1    Francis, P.2
  • 23
    • 33749059202 scopus 로고    scopus 로고
    • Efficient packet classification using tcams
    • Dec
    • Derek Pao, Yiu Keung Lia, and Peng Zhoua. Efficient packet classification using tcams. Computer Networks, 50(18):3523-3535, Dec 2006.
    • (2006) Computer Networks , vol.50 , Issue.18 , pp. 3523-3535
    • Pao, D.1    Yiu, K.2    Peng, Z.3
  • 26
    • 0033902127 scopus 로고    scopus 로고
    • A modular approach to packet classification: Algorithms and results
    • March
    • Thomas Y. C. Woo. A modular approach to packet classification: Algorithms and results. In IEEE INFOCOM'00, pages 1213-1222, March 2000.
    • (2000) IEEE INFOCOM'00 , pp. 1213-1222
    • Woo, T.Y.C.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.