A Fault-Tolerant Bloom Filter for Deep Packet Inspection
暂无分享,去创建一个
[1] Stamatis Vassiliadis,et al. A reconfigurable perfect-hashing scheme for packet inspection , 2005, International Conference on Field Programmable Logic and Applications, 2005..
[2] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[3] John W. Lockwood,et al. Deep packet inspection using parallel bloom filters , 2004, IEEE Micro.
[4] Timothy Sherwood,et al. A high throughput string matching architecture for intrusion detection and prevention , 2005, 32nd International Symposium on Computer Architecture (ISCA'05).
[5] H. Jonathan Chao,et al. Multi-packet signature detection using prefix bloom filters , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..
[6] Evangelos P. Markatos,et al. Exclusion-based Signature Matching for Intrusion Detection , 2002 .
[7] George Varghese,et al. Deterministic memory-efficient string matching algorithms for intrusion detection , 2004, IEEE INFOCOM 2004.
[8] M. V. Ramakrishna,et al. Efficient Hardware Hashing Functions for High Performance Computers , 1997, IEEE Trans. Computers.