Blooming

Table of Contents Blooming Project summary Background Features Download Install from NetFPGA Yum repository

Blooming

Project summary

Status :

Release Pending

Version :

1.0

Authors

Hardware : Cristian Vairo Software : Gianni Antichi Demonstration : Gianni Antichi

NetFPGA base source :

1.2.5

Background

Because of the rapid growth of both traffic and links capacity, the time budget to perform IP address lookup on a packet continues to decrease and lookup tables of routers unceasingly grow. Therefore, new lookup algorithms and new hardware platform are required. This solution presents a new scheme on top of the NetFPGA board which takes advantage of parallel queries made on perfect hash functions. Such functions are built by using a very compact and fast data structure called Blooming Trees, thus allowing the vast majority of memory accesses to involve small and fast on-chip memories only.

Features

• Use of an array of Blooming Tree.
• Blooming Tree is a new scheme to construct a Minimal Perfect Hash Function (MPHF) based on an alternative to Bloom Filters.
• We use a MPHF for each prefix length greater than 15.
• We use a single Direct Addressing (DA) for other lengths.
• When packet arrives, checks all the MPHFs and DA at the same time.
• The Forwading Table is stored in Block RAM and in SRAM.
• Up to 130.000 entries

Download

Install from NetFPGA Yum repository

1. Install the NetFPGA Base Package