All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Adaptive Development of Hash Functions in FPGA-Based Network Routers

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F16%3APU121657" target="_blank" >RIV/00216305:26230/16:PU121657 - isvavai.cz</a>

  • Result on the web

    <a href="http://ieeexplore.ieee.org/document/7850171/" target="_blank" >http://ieeexplore.ieee.org/document/7850171/</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Adaptive Development of Hash Functions in FPGA-Based Network Routers

  • Original language description

    Accelerated network technologies are crucial for implementing packet processing in high-speed computer networks and therefore, network routers accelerated by field-programmable gate arrays (FPGAs) are becoming common. One of the time-critical jobs in routers is packet classification which requires rapid lookup in tables. Fast hash computation is a must in order to process the packets in time. Adaptive development of hash functions is proposed in this paper. The hash functions are based on non-linear feedback shift registers and configured by an evolutionary algorithm. The hash functions are developed inside of an FPGA-based network router and fine-tuned for the given table content. The experiments on the problem of hashing Internet Protocol (IP) addresses demonstrate that the evolved simple hash functions provide faster hash computation, better memory resource utilization and require smaller chip area in comparison with conventional hash functions. The best conventional hash function was able to store by a couple of hundred less IP addresses in a 8k hash table, the computation of hashes was by 42% slower, and the implementation required 15-times more hardware area.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

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

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2016

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    2016 IEEE Symposium Series on Computational Intelligence

  • ISBN

    978-1-5090-4240-1

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    1-8

  • Publisher name

    IEEE Computational Intelligence Society

  • Place of publication

    Athens

  • Event location

    Athens

  • Event date

    Dec 6, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article