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 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.

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.

DWMH: An Improved Algorithm Based on WM for Large-Scale Pattern Set

2013 ◽  
Vol 765-767 ◽  
pp. 963-967
Author(s):  
Xiao Ning Xu ◽  
Ai Ping Li ◽  
Jun Xing Zhu
Keyword(s):  
High Speed ◽  
Large Scale ◽  
String Matching ◽  
Hash Table ◽  
Matching Algorithm ◽  
Set Size ◽  
Security Applications ◽  
Network Bandwidth ◽  
Key Technologies ◽  
Improved Algorithm

String matching algorithm is one of the key technologies in numerous network security applications and systems. Nowadays, the increasing network bandwidth and pattern set size both call for high speed string matching algorithm for large-scale pattern set. An improved algorithm based on WM algorithm for large-scale pattern set is proposed in this paper. The presented multiple pattern string matching algorithm, DWMH, which we call in brief, combines the idea of Horspool algorithm with WM algorithm and applies the method of double hash to revise WMs HASH table to achieve better performance. Our extensive experiments demonstrated that DWMH algorithm is more efficient than WM algorithm, particularly when the size of pattern set becomes large-scale.

Identifying Large Flows Based on SDBF Algorithm in High Speed Network Measurement

2015 ◽  
Vol 713-715 ◽  
pp. 2503-2506
Author(s):  
Lei Bai ◽  
Chao Chen
Keyword(s):  
Measurement Error ◽  
Theoretical Analysis ◽  
Processing Speed ◽  
Traffic Engineering ◽  
High Speed ◽  
Network Flows ◽  
Bloom Filter ◽  
Network Measurement ◽  
Storage Space ◽  
High Speed Network

It is very important in developing effective and efficient traffic engineering schemes for identifying large flows. In this paper, according to the characteristic of network flows, a new algorithm which combined by scalable bloom filter and dynamic bloom filter is proposed to realize elephant flows identification. This method can improve the performance of network measurement and the efficiency of the resource usage of measurement system by handling flows with different strategy according to its different feature. The theoretical analysis and the simulation result indicate that under the condition of existing some tolerable measurement error about the length of flows, our algorithm can identify elephant flows accurately, which reduce the storage space and improve the processing speed efficiently.

Sign in / Sign up

Export Citation Format

Share Document