Publication Details
Evolutionary design of hash function pairs for network filters
Kořenek Jan, doc. Ing., Ph.D. (DCSY FIT BUT)
Sekanina Lukáš, prof. Ing., Ph.D. (DCSY FIT BUT)
evolution, hash function, network filter, field-programmable gate
array, cuckoo
Network filtering is a challenging area in high-speed computer networks, mostly because lots of filtering rules are required and there is only a limited time available for matching these rules. Therefore, network filters accelerated by field-programmable gate arrays (FPGAs) are becoming common where the fast lookup of filtering rules is achieved by the use of hash tables. It is desirable to be able to fill-up these tables efficiently, i.e. to achieve a high table-load factor in order to reduce the offline time of the network filter due to rehashing and/or table replacement. A parallel reconfigurable hash function tuned by an evolutionary algorithm (EA) is proposed in this paper for Internet Protocol (IP) address filtering in FPGAs. The EA fine-tunes the reconfigurable hash function for a given set of IP addresses. The experiments demonstrate that the proposed hash function provides high-speed lookup and achieves a higher table-load factor in comparison with conventional solutions.
@ARTICLE{FITPUB11244,
author = "Roland Dobai and Jan Ko\v{r}enek and Luk\'{a}\v{s} Sekanina",
title = "Evolutionary design of hash function pairs for network filters",
pages = "173--181",
journal = "Applied Soft Computing",
volume = 56,
number = 7,
year = 2017,
ISSN = "1568-4946",
doi = "10.1016/j.asoc.2017.03.009",
language = "english",
url = "https://www.fit.vut.cz/research/publication/11244"
}