Publication detail

Evolutionary design of hash function pairs for network filters

DOBAI, R. KOŘENEK, J. SEKANINA, L.

Original Title

Evolutionary design of hash function pairs for network filters

Type

journal article in Web of Science

Language

English

Original Abstract

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.

Keywords

evolution, hash function, network filter, field-programmable gate array, cuckoo

Authors

DOBAI, R.; KOŘENEK, J.; SEKANINA, L.

Released

6. 3. 2017

ISBN

1568-4946

Periodical

APPLIED SOFT COMPUTING

Year of study

56

Number

7

State

Kingdom of the Netherlands

Pages from

173

Pages to

181

Pages count

9

URL

http://dx.doi.org/10.1016/j.asoc.2017.03.009

BibTex

@article{BUT134465,
  author="Roland {Dobai} and Jan {Kořenek} and Lukáš {Sekanina}",
  title="Evolutionary design of hash function pairs for network filters",
  journal="APPLIED SOFT COMPUTING",
  year="2017",
  volume="56",
  number="7",
  pages="173--181",
  doi="10.1016/j.asoc.2017.03.009",
  issn="1568-4946",
  url="http://dx.doi.org/10.1016/j.asoc.2017.03.009"
}