Evolutionary design of hash functions for IP address hashing using genetic programming

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F17%3APU126383" target="_blank" >RIV/00216305:26230/17:PU126383 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/CEC.2017.7969509" target="_blank" >http://dx.doi.org/10.1109/CEC.2017.7969509</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/CEC.2017.7969509" target="_blank" >10.1109/CEC.2017.7969509</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Evolutionary design of hash functions for IP address hashing using genetic programming

Popis výsledku v původním jazyce

Hash tables are common lookup data structures. A key element of such data structure is a hash function because it greatly affects its latency. A badly designed hash function may slow down the hash table by producing hash collisions which is a negative state that has to be resolved using additional computation time. There is no deterministic method for designing a well performing hash function. The designer solely relies on his/her experience, knowledge or intuition. This paper focuses on the evolutionary design of hash functions for Cuckoo hashing which is a modern approach to collision resolution. Its main benefit is constant time complexity of lookup which is achieved by using two or more hash functions per hash table. Hash functions are automatically designed using common elementary hashing operations such as multiplication or binary shift by means of genetic programming. The evolved hash functions are about 2.7 to 7 times faster, can utilize about 1 to 1.6% more keys and use fewer elementary operations than human-created counterparts on the IP address hashing problem.

Název v anglickém jazyce

Evolutionary design of hash functions for IP address hashing using genetic programming

Popis výsledku anglicky

Hash tables are common lookup data structures. A key element of such data structure is a hash function because it greatly affects its latency. A badly designed hash function may slow down the hash table by producing hash collisions which is a negative state that has to be resolved using additional computation time. There is no deterministic method for designing a well performing hash function. The designer solely relies on his/her experience, knowledge or intuition. This paper focuses on the evolutionary design of hash functions for Cuckoo hashing which is a modern approach to collision resolution. Its main benefit is constant time complexity of lookup which is achieved by using two or more hash functions per hash table. Hash functions are automatically designed using common elementary hashing operations such as multiplication or binary shift by means of genetic programming. The evolved hash functions are about 2.7 to 7 times faster, can utilize about 1 to 1.6% more keys and use fewer elementary operations than human-created counterparts on the IP address hashing problem.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA16-08565S" target="_blank" >GA16-08565S: Rozvoj kryptoanalytických metod prostřednictvím evolučních výpočtů</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2017

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

2017 IEEE Congress on Evolutionary Computation (CEC)

ISBN

978-1-5090-4601-0

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

1720-1727

Název nakladatele

Institute of Electrical and Electronics Engineers

Místo vydání

San Sebastian

Místo konání akce

Donostia - San Sebastián

Datum konání akce

5. 6. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000426929700222