Boundary Hash for Memory-Efficient Deep Packet Inspection

Autor:	Masanori Bando, Hung-Hsiang Jonathan Chao, N.S. Artan
Rok vydání:	2008
Předmět:	Set (abstract data type) Computer science Network security business.industry Network packet Hash function Byte Deep packet inspection business Data structure Perfect hash function Computer network
Zdroj:	ICC
DOI:	10.1109/icc.2008.333
Popis:	Network intrusion detection and prevention systems (NIDPSs) are critical for network security. The deep packet inspection (DPI) operation consumes a significant amount of resources in NIDPS. This is because to detect malicious activity DPI searches a database of signatures for each byte of every packet. In this paper, we develop a highly space-efficient data structure for hardware realization of minimal perfect hash functions (MPHFs). This data structure is simple to construct, requires 7 n bits to represent the MPHF for a set of n keys and allows high-speed DPI.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c57dbf0bc3105f9b1abb6a358c8c1511 https://doi.org/10.1109/icc.2008.333 Zobrazit plný text záznamu