A Fingerprint-based Fast Hash Table for High-Speed Packet Processing

2012 ◽  
Vol 7 (19) ◽  
pp. 251-260
Author(s):  
Xuyu Xiang ◽  
Jiaohua Qin
2016 ◽  
Vol E99.D (3) ◽  
pp. 747-750 ◽  
Author(s):  
Seon-Ho SHIN ◽  
Jooyoung LEE ◽  
Jong-Hyun KIM ◽  
Ikkyun KIM ◽  
MyungKeun YOON
Keyword(s):  

2018 ◽  
Vol 2018 ◽  
pp. 1-12
Author(s):  
Wenqi Chen ◽  
Hui Tian ◽  
Chin-Chen Chang ◽  
Fulin Nan ◽  
Jing Lu

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.


2021 ◽  
Vol 38 (1-2) ◽  
pp. 1-45
Author(s):  
Georgios P. Katsikas ◽  
Tom Barbette ◽  
Dejan Kostić ◽  
JR. Gerald Q. Maguire ◽  
Rebecca Steinert

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.


2013 ◽  
Vol 765-767 ◽  
pp. 963-967
Author(s):  
Xiao Ning Xu ◽  
Ai Ping Li ◽  
Jun Xing Zhu

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.


Sensors ◽  
2019 ◽  
Vol 19 (11) ◽  
pp. 2563 ◽  
Author(s):  
Jaehyung Wee ◽  
Jin-Ghoo Choi ◽  
Wooguil Pak

Vehicle-to-Everything (V2X) requires high-speed communication and high-level security. However, as the number of connected devices increases exponentially, communication networks are suffering from huge traffic and various security issues. It is well known that performance and security of network equipment significantly depends on the packet classification algorithm because it is one of the most fundamental packet processing functions. Thus, the algorithm should run fast even with the huge set of packet processing rules. Unfortunately, previous packet classification algorithms have focused on the processing speed only, failing to be scalable with the rule-set size. In this paper, we propose a new packet classification approach balancing classification speed and scalability. It can be applied to most decision tree-based packet classification algorithms such as HyperCuts and EffiCuts. It determines partitioning fields considering the rule duplication explicitly, which makes the algorithm memory-effective. In addition, the proposed approach reduces the decision tree size substantially with the minimal sacrifice of classification performance. As a result, we can attain high-speed packet classification and scalability simultaneously, which is very essential for latest services such as V2X and Internet-of-Things (IoT).


2019 ◽  
Vol 149 ◽  
pp. 187-199 ◽  
Author(s):  
Leonardo Linguaglossa ◽  
Dario Rossi ◽  
Salvatore Pontarelli ◽  
Dave Barach ◽  
Damjan Marjon ◽  
...  

2007 ◽  
Vol 31 (3) ◽  
pp. 188-199 ◽  
Author(s):  
K. Vlachos ◽  
T. Orphanoudakis ◽  
Y. Papaeftathiou ◽  
N. Nikolaou ◽  
D. Pnevmatikatos ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document