Comparison of Cuckoo Hash Table and Bloom Filter for Fast Packet Filtering Using Data Plane Development Kit
| Autor: | Karlo Slovenec, Lucija Petricioli, Ivan Sicic, Miljenko Mikuc |
|---|---|
| Přispěvatelé: | Begušić, Dinko, Rožić, Nikola, Radić, Joško, Šarić, Matko |
| Rok vydání: | 2019 |
| Předmět: |
Hardware_MEMORYSTRUCTURES
cuckoo hash bloom filter packet filtering Data Plane Development Kit lawful interception Computer science 020302 automobile design & engineering 020206 networking & telecommunications Context (language use) 02 engineering and technology Bloom filter Cuckoo hashing 0203 mechanical engineering Computer engineering Lawful interception Packet analyzer 0202 electrical engineering electronic engineering information engineering Forwarding plane Table (database) Cache |
| Zdroj: | SoftCOM |
| DOI: | 10.23919/softcom.2019.8903891 |
| Popis: | This paper presents a performance comparison of the cuckoo hash table and Bloom filter for packet classification with application in packet filtering with emphasis on lawful interception systems. Alongside enabling fast packet capture on commodity hardware, Data Plane Development Kit offers those methods already implemented in its library. We have chosen the cuckoo hash table as an exact classification method and the Bloom filter as a space-efficient probabilistic method that should have a better cache utilization and therefore more viable usage in performance critical systems, but allows false positive results. The execution time and memory requirements of the two methods are compared to determine whether the performance benefits of using a probabilistic method outweigh its drawbacks, and in which context those benefits arise. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|