A Bloom Filter Bank Based Hash Table for High Speed Packet Processing

2014 ◽  
Author(s):  
Nicola Bonelli ◽  
Christian Callegari ◽  
Stefano Giordano ◽  
Gregorio Procissi
Keyword(s):  
High Speed ◽  
Filter Bank ◽  
Hash Table ◽  
Bloom Filter ◽  
Packet Processing

scholarly journals Vectored-Bloom Filter for IP Address Lookup: Algorithm and Hardware Architectures

2019 ◽  
Vol 9 (21) ◽  
pp. 4621 ◽  
Author(s):  
Hayoung Byun ◽  
Qingling Li ◽  
Hyesook Lim
Keyword(s):  
High Speed ◽  
High Performance ◽  
Hash Table ◽  
Bloom Filter ◽  
Ip Address ◽  
Behavior Simulation ◽  
Field Programmable ◽  
Ip Address Lookup ◽  
Flexible Architecture ◽  
Timing Simulation

The Internet Protocol (IP) address lookup is one of the most challenging tasks for Internet routers, since it requires to perform packet forwarding at wire-speed for tens of millions of incomming packets per second. Efficient IP address lookup algorithms have been widely studied to satisfy this requirement. Among them, Bloom filter-based approach is attractive in providing high performance. This paper proposes a high-speed and flexible architecture based on a vectored-Bloom filter (VBF), which is a space-efficient data structure that can be stored in a fast on-chip memory. An off-chip hash table is infrequently accessed, only when the VBF fails to provide address lookup results. The proposed architecture has been evaluated through both a behavior simulation with C language and a timing simulation with Verilog. The hardware implementation result shows that the proposed architecture can achieve the throughput of 5 million packets per second in a field programmable gate array (FPGA) operated at 100 MHz.

Rectangular hash table: Bloom filter and bitmap assisted hash table with high speed

2017 ◽  
Author(s):  
Tong Yang ◽  
Binchao Yin ◽  
Hang Li ◽  
Muhammad Shahzad ◽  
Steve Uhlig ◽  
...  
Keyword(s):  
High Speed ◽  
Hash Table ◽  
Bloom Filter

scholarly journals Hash Table with Expanded-Key for High-Speed Networking

2016 ◽  
Vol E99.D (3) ◽  
pp. 747-750 ◽  
Author(s):  
Seon-Ho SHIN ◽  
Jooyoung LEE ◽  
Jong-Hyun KIM ◽  
Ikkyun KIM ◽  
MyungKeun YOON
Keyword(s):  
High Speed ◽  
Hash Table

scholarly journals Adjacency-Hash-Table Based Public Auditing for Data Integrity in Mobile Cloud Computing

2018 ◽  
Vol 2018 ◽  
pp. 1-12
Author(s):  
Wenqi Chen ◽  
Hui Tian ◽  
Chin-Chen Chang ◽  
Fulin Nan ◽  
Jing Lu
Keyword(s):  
Cloud Computing ◽  
High Speed ◽  
Security Analysis ◽  
Hash Table ◽  
The State ◽  
Public Auditing ◽  
The Arts ◽  
High Speed Data ◽  
And Performance ◽  
Data Updating

Cloud storage, one of the core services of cloud computing, provides an effective way to solve the problems of storage and management caused by high-speed data growth. Thus, a growing number of organizations and individuals tend to store their data in the cloud. However, due to the separation of data ownership and management, it is difficult for users to check the integrity of data in the traditional way. Therefore, many researchers focus on developing several protocols, which can remotely check the integrity of data in the cloud. In this paper, we propose a novel public auditing protocol based on the adjacency-hash table, where dynamic auditing and data updating are more efficient than those of the state of the arts. Moreover, with such an authentication structure, computation and communication costs can be reduced effectively. The security analysis and performance evaluation based on comprehensive experiments demonstrate that our protocol can achieve all the desired properties and outperform the state-of-the-art ones in computing overheads for updating and verification.

scholarly journals A New Bloom Filter Architecture for FIB Lookup in Named Data Networking

2019 ◽  
Vol 9 (2) ◽  
pp. 329 ◽  
Author(s):  
Hayoung Byun ◽  
Hyesook Lim
Keyword(s):  
Network Traffic ◽  
High Speed ◽  
Bloom Filter ◽  
Future Internet ◽  
Bloom Filters ◽  
Named Data Networking ◽  
Future Internet Architecture ◽  
Massive Growth ◽  
Filter Architecture ◽  
Data Networking

Network traffic has increased rapidly in recent years, mainly associated with the massive growth of various applications on mobile devices. Named data networking (NDN) technology has been proposed as a future Internet architecture for effectively handling this ever-increasing network traffic. In order to realize the NDN, high-speed lookup algorithms for a forwarding information base (FIB) are crucial. This paper proposes a level-priority trie (LPT) and a 2-phase Bloom filter architecture implementing the LPT. The proposed Bloom filters are sufficiently small to be implemented with on-chip memories (less than 3 MB) for FIB tables with up to 100,000 name prefixes. Hence, the proposed structure enables high-speed FIB lookup. The performance evaluation result shows that FIB lookups for more than 99.99% of inputs are achieved without needing to access the database stored in an off-chip memory.

scholarly journals Metron

2021 ◽  
Vol 38 (1-2) ◽  
pp. 1-45
Author(s):  
Georgios P. Katsikas ◽  
Tom Barbette ◽  
Dejan Kostić ◽  
JR. Gerald Q. Maguire ◽  
Rebecca Steinert
Keyword(s):  
Load Balancing ◽  
High Speed ◽  
State Of The Art ◽  
Single Server ◽  
Packet Processing ◽  
Commodity Hardware ◽  
Multiple Servers ◽  
Underlying Network ◽  
Network Functions

Deployment of 100Gigabit Ethernet (GbE) links challenges the packet processing limits of commodity hardware used for Network Functions Virtualization (NFV). Moreover, realizing chained network functions (i.e., service chains) necessitates the use of multiple CPU cores, or even multiple servers, to process packets from such high speed links. Our system Metron jointly exploits the underlying network and commodity servers’ resources: ( i ) to offload part of the packet processing logic to the network, ( ii )  by using smart tagging to setup and exploit the affinity of traffic classes, and ( iii )  by using tag-based hardware dispatching to carry out the remaining packet processing at the speed of the servers’ cores, with zero inter-core communication. Moreover, Metron transparently integrates, manages, and load balances proprietary “blackboxes” together with Metron service chains. Metron realizes stateful network functions at the speed of 100GbE network cards on a single server, while elastically and rapidly adapting to changing workload volumes. Our experiments demonstrate that Metron service chains can coexist with heterogeneous blackboxes, while still leveraging Metron’s accurate dispatching and load balancing. In summary, Metron has ( i )  2.75–8× better efficiency, up to ( ii )  4.7× lower latency, and ( iii )  7.8× higher throughput than OpenBox, a state-of-the-art NFV system.

Sign in / Sign up

Export Citation Format

Share Document