Research Article
Optimization of Lookup Schemes for Flow-Based Packet Classification on FPGAs
Algorithm 1
Ruleset population algorithm for IND.
Require: Range bounds for all UVs at each chunk, number of rules | (1) for to do | (2) | // simulate lookups for each rule and build BV | (3) for to do | (4) for to do | (5) if and then | (6) or | (7) end if | (8) end for | // check if BV already exists for other key value | (9) | (10) while and do | (11) | (12) end while | // if BV not found, increment UR counter | (13) if then | (14) | (15) end if | // store UR and BV for current key value. Just will be transferred to lookup engine (FPGA) | (16) | (17) | (18) end for | (19) | (20) end for |
|