An index-split Bloom filter for deep packet inspection (Q543154): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041674436 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient string matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Network Applications of Bloom Filters: A Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Less hashing, same performance: Building a better Bloom filter / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5693268 / rank | |||
Normal rank | |||
Latest revision as of 04:55, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An index-split Bloom filter for deep packet inspection |
scientific article |
Statements
An index-split Bloom filter for deep packet inspection (English)
0 references
17 June 2011
0 references
network security
0 references
packet processing
0 references
deep packet inspection
0 references
hash table
0 references
Bloom filter
0 references
