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.

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.

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

Hash Technology for Connection Management in High-Speed Networks

2014 ◽  
Vol 998-999 ◽  
pp. 1151-1156
Author(s):  
Rong Ji Liu ◽  
Yun Zhao Li ◽  
Chun Xia Cao
Keyword(s):  
Hash Function ◽  
High Speed ◽  
Random Number ◽  
Hash Table ◽  
Process Time ◽  
Computation Cost ◽  
Connection Management ◽  
Random Number Table ◽  
Technical Idea ◽  
Better Than

Connection management uses hash table. Hash function and data structure are both the bottleneck technology. For balancing computation cost and uniformity of hash function, three new hash functions were devised——the Random number Mapping Xor (RMX) function based on random number table mapping, the Segment Sampling Xor (SSX) function and Byte by Byte Shift Xor (BBSX) function based on segment generation and bit operations. The results show that these three functions are all better than IPSX on uniformity. This paper analyzed memory access performance and miss rate of multiple slots hash table, and presented the technical idea for shorting packet process time in connection management. Simulation is described.

Microfabrication research at the National Submicron Facility

1983 ◽  
Vol 41 ◽  
pp. 86-89
Author(s):  
E.D. Wolf
Keyword(s):  
Integrated Circuits ◽  
Particle Physics ◽  
High Speed ◽  
New Technology ◽  
High Energy ◽  
High Energy Particle ◽  
New Science ◽  
Wide Range ◽  
Intermediate Domain ◽  
Circuit Function

Most microelectronics devices and circuits operate faster, consume less power, execute more functions and cost less per circuit function when the feature-sizes internal to the devices and circuits are made smaller. This is part of the stimulus for the Very High-Speed Integrated Circuits (VHSIC) program. There is also a need for smaller, more sensitive sensors in a wide range of disciplines that includes electrochemistry, neurophysiology and ultra-high pressure solid state research. There is often fundamental new science (and sometimes new technology) to be revealed (and used) when a basic parameter such as size is extended to new dimensions, as is evident at the two extremes of smallness and largeness, high energy particle physics and cosmology, respectively. However, there is also a very important intermediate domain of size that spans from the diameter of a small cluster of atoms up to near one micrometer which may also have just as profound effects on society as “big” physics.

Vacuum System to Minimize the Specimen Contamination of High-Performance EM

1977 ◽  
Vol 35 ◽  
pp. 68-69
Author(s):  
N. Yoshimura ◽  
K. Shirota ◽  
T. Etoh
Keyword(s):  
Electron Microscope ◽  
High Speed ◽  
High Performance ◽  
High Vacuum ◽  
Vacuum System ◽  
Pump System ◽  
Pumping System ◽  
Diffusion Pump ◽  
Almost All ◽  
Cascade Type

One of the most important requirements for a high-performance EM, especially an analytical EM using a fine beam probe, is to prevent specimen contamination by providing a clean high vacuum in the vicinity of the specimen. However, in almost all commercial EMs, the pressure in the vicinity of the specimen under observation is usually more than ten times higher than the pressure measured at the punping line. The EM column inevitably requires the use of greased Viton O-rings for fine movement, and specimens and films need to be exchanged frequently and several attachments may also be exchanged. For these reasons, a high speed pumping system, as well as a clean vacuum system, is now required. A newly developed electron microscope, the JEM-100CX features clean high vacuum in the vicinity of the specimen, realized by the use of a CASCADE type diffusion pump system which has been essentially improved over its predeces- sorD employed on the JEM-100C.

The on-line use of histogram data for high-speed correction and alignment of electron microscope images

1984 ◽  
Vol 42 ◽  
pp. 556-557
Author(s):  
William Krakow
Keyword(s):  
Power Spectrum ◽  
High Speed ◽  
Direct Memory Access ◽  
Digital Television ◽  
Contrast Transfer Function ◽  
The Past ◽  
High Resolution Tem ◽  
On Line ◽  
Correction Of Astigmatism ◽  
The Fourier Transform

In the past few years on-line digital television frame store devices coupled to computers have been employed to attempt to measure the microscope parameters of defocus and astigmatism. The ultimate goal of such tasks is to fully adjust the operating parameters of the microscope and obtain an optimum image for viewing in terms of its information content. The initial approach to this problem, for high resolution TEM imaging, was to obtain the power spectrum from the Fourier transform of an image, find the contrast transfer function oscillation maxima, and subsequently correct the image. This technique requires a fast computer, a direct memory access device and even an array processor to accomplish these tasks on limited size arrays in a few seconds per image. It is not clear that the power spectrum could be used for more than defocus correction since the correction of astigmatism is a formidable problem of pattern recognition.

Sign in / Sign up

Export Citation Format

Share Document