Highly Memory-Efficient LogLog Hash for Deep Packet Inspection

被引:0
|
作者
Bando, Masanori [1 ]
Artan, N. Sertac [1 ]
Chao, H. Jonathan [1 ]
机构
[1] NYU, Polytech Inst, Dept Elect & Comp Engn, New York, NY 10003 USA
关键词
D O I
10.1109/GLOCOM.2008.ECP.391
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Today's network line rates reach speeds of 40 Gbps and are anticipated to reach 100 Gbps in the near future. These high speeds make Deep Packet Inspection (DPI) in Network Intrusion Detection and Prevention Systems (NIDPSs) very challenging. The DPI examines each incoming packet byte-by-byte and matches them against a set of predefined malicious signatures. One way to achieve high-speed DPI is to store all the signatures on high-speed on-chip memory. However, on-chip memory is limited and space-efficient data structures are needed to leverage precious on-chip memory efficiently. A hash table addressed by a Minimal Perfect Hash Function (MPHF) is such a high-speed, space efficient data structure. In this paper, we describe a highly memory-efficient MPHF, which requires 3.5 bits per key to facilitate access to the key in on-chip memory while allowing us to perform the expensive exact match operation only once. The proposed MPHF also has a low construction time.
引用
下载
收藏
页数:6
相关论文
共 50 条
  • [1] Boundary hash for memory-efficient Deep Packet Inspection
    Artan, N. Sertac
    Bando, Masanori
    Chao, H. Jonathan
    2008 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROCEEDINGS, VOLS 1-13, 2008, : 1732 - 1737
  • [2] A memory-efficient heterogeneous parallel pattern matching scheme in deep packet inspection
    Kim, HyunJin
    Hong, Hyejeong
    Baek, Dongmyoung
    Ahn, Jin-Ho
    Kang, Sungho
    IEICE ELECTRONICS EXPRESS, 2010, 7 (05): : 377 - 382
  • [3] A Pattern Partitioning Algorithm for Memory-Efficient Parallel String Matching in Deep Packet Inspection
    Kim, HyunJin
    Hong, Hyejeong
    Baek, Dongmyoung
    Kang, Sungho
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2010, E93B (06) : 1612 - 1614
  • [4] Memory-Efficient Hash Joins
    Barber, R.
    Lohman, G.
    Pandis, I.
    Raman, V.
    Sidle, R.
    Attaluri, G.
    Chainani, N.
    Lightstone, S.
    Sharpe, D.
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2014, 8 (04): : 353 - 364
  • [5] A Memory-Efficient Bit-Split Pattern Matching Architecture Using Shared Match Vectors for Deep Packet Inspection
    Kim, HyunJin
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2012, E95B (11) : 3594 - 3596
  • [6] A Memory-Efficient Pattern Matching with Hardware-Based Bit-Split String Matchers for Deep Packet Inspection
    Kim, Hyunjin
    Kim, Hong-Sik
    Lee, Jung-Hee
    Ahn, Jin-Ho
    Kang, Sungho
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2010, E93B (02) : 396 - 398
  • [7] Memory Efficient Deep Packet Inspection Using Transition Functions
    Lakshmi, K. Vasanta
    2016 8TH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS AND NETWORKS (COMSNETS), 2016,
  • [8] High-Throughput and Memory-Efficient Multimatch Packet Classification Based on Distributed and Pipelined Hash Tables
    Xu, Yang
    Liu, Zhaobo
    Zhang, Zhuoyuan
    Chao, H. Jonathan
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2014, 22 (03) : 982 - 995
  • [9] Module-Based Finite Automata: A Scalable and Memory-Efficient Architecture for Multi-pattern Matching in Deep Packet Inspection
    Jiang, Junchen
    Tang, Yi
    Wang, Xiaofei
    Liu, Bin
    COMMUNICATION AND NETWORKING, 2009, 56 : 149 - +
  • [10] Hybrid memory-efficient multimatch packet classification for NIDS
    Lee, KyuHee
    Yun, SangKyun
    MICROPROCESSORS AND MICROSYSTEMS, 2015, 39 (02) : 113 - 121