Packet Classification with Evolvable Hardware Hash Functions Harald

Packet Classification with Evolvable Hardware Hash Functions Harald Widiger, Mathias Handy, Dirk Timmermann University of Rostock Institute of Applied Microelectronics and Computer Science

Packet Classification and Hash Functions o o Packet Classification Problem: In huge rule sets a search takes much time and/or demands huge memories Hash functions have a search complexity of ideally O(1) and memory demand of O(N) n 3/2/2021 Problem when using (hardware) hash functions: o High performance for different key sets o Low hardware costs for a hardware implementation 2

Evolvable Hardware o o Goal: High performance for different and changing key set with low hardware costs Solution: a function which can adapt constantly and autonomously to an actual key set evolvable hardware 3/2/2021 3

Hardware Hash Function o Genomesize: 3/2/2021 4

System Architecture o Hardware consists of a datapath and an evolution module n n 3/2/2021 In the datapath the packet classification is done by finding classification rules for incoming frames with the help of the hash functions The evolution module changes the hash function depending on the existing key to increase lookup performance 5

Evolutionary Algorithm 3/2/2021 6

Simulation Results 3/2/2021 7

Outlook o o Hardware implementation into an FPGA Simulation of the lookup performance with real rules sets Improvement of the performance of the fitness evaluation Finally implementation in a dynamically reconfigurable environment 3/2/2021 8