scholarly journals A Novel Prefix Cache with Two-Level Bloom Filters in IP Address Lookup

2020 ◽  
Vol 10 (20) ◽  
pp. 7198
Author(s):  
Junghwan Kim ◽  
Myeong-Cheol Ko ◽  
Moon Sun Shin ◽  
Jinsoo Kim
Keyword(s):  
False Positive ◽  
Bloom Filter ◽  
Bloom Filters ◽  
Experimental Result ◽  
Ip Address ◽  
Positive Ratio ◽  
Ip Addresses ◽  
False Positive Ratio ◽  
Ip Address Lookup ◽  
Filter Size

Prefix caching is one of the notable techniques in enhancing the IP address lookup performance which is crucial in packet forwarding. A cached prefix can match a range of IP addresses, so prefix caching leads to a higher cache hit ratio than IP address caching. However, prefix caching has an issue to be resolved. When a prefix is matched in a cache, the prefix cannot be the result without assuring that there is no longer descendant prefix of the matching prefix which is not cached yet. This is due to the aspect of the IP address lookup seeking to find the longest matching prefix. Some prefix expansion techniques avoid the problem, but the expanded prefixes occupy more entries as well as cover a smaller range of IP addresses. This paper proposes a novel prefix caching scheme in which the original prefix can be cached without expansion. In this scheme, for each prefix, a Bloom filter is constructed to be used for testing if there is any matchable descendant. The false positive ratio of a Bloom filter generally grows as the number of elements contained in the filter increases. We devise an elaborate two-level Bloom filter scheme which adjusts the filter size at each level, to reduce the false positive ratio, according to the number of contained elements. The experimental result shows that the proposed scheme achieves a very low cache miss ratio without increasing the number of prefixes. In addition, most of the filter assertions are negative, which means the proposed prefix cache effectively hits the matching prefix using the filter.

Implementation of Improved Hash and Mapping Modified Low Power Parallel Bloom Filter Design

2013 ◽  
Vol 7 (4) ◽  
pp. 11-21
Author(s):  
K. Saravanan ◽  
A. Senthilkumar
Keyword(s):  
Low Power ◽  
False Positive ◽  
Filter Design ◽  
Parallel Architecture ◽  
Bloom Filter ◽  
Bloom Filters ◽  
Positive Ratio ◽  
False Positive Ratio ◽  
Field Programmable ◽  
Mapping Scheme

In this article, the authors present an investigation on bloom filters and introduce a new improved variant, which uses a secure modified hash function and suggested improved mapping scheme with an efficient parallel architecture. This novel architecture provides efficient, relatively fast membership querying and compact information representation with negligible false positive. This is relatively a low power and secure design with very less false positive ratio when compared with the traditional bloom filters. The design has been evaluated and tested using Xilinx 65 nm Virtex-5 field-programmable gate array as the target technology. The performance matrices are false positive ratio, power, speed and compactness.

scholarly journals A Novel Hardware Security Architecture: PD-CRP(PUF Database & Challenge-Response Pair) Bloom Filter on Memristor Based PUF

2020 ◽  
Author(s):  
Jungwon Lee ◽  
Seoyeon Choi ◽  
Dayoung Kim ◽  
Yunyoung Choi ◽  
Wookyung Sun
Keyword(s):  
Data Transmission ◽  
Hardware Security ◽  
Bloom Filter ◽  
Transmission Error ◽  
Bloom Filters ◽  
Search Performance ◽  
Security Technology ◽  
Security Environment ◽  
Filter Size ◽  
Simulation Results

Because the development of the internet of things (IoT) requires technology that transfers information between objects without human intervention, the core of IoT security will be secure authentication between devices or between devices and servers. Software-based authentication may be a security vulnerability in IoT, but hardware-based security technology can provide a strong security environment. A physical unclonable functions (PUFs) are a hardware security element suitable for lightweight applications. PUFs can generate challenge-response pairs(CRPs) that cannot be controlled or predicted by utilizing inherent physical variations that occur in the manufacturing process. In particular, pulse width memristive PUF (PWM-PUF) improves security performance by applying different write pulse widths and bank structures. Bloom filter (BF) is probabilistic data structures that answer membership queries using small memories. Bloom filter can improve search performance and reduce memory usage and are used in areas such as networking, security, big data, and IoT. In this paper, we propose a structure that applies Bloom filters based on the PWM-PUF to reduce PUF data transmission errors. The proposed structure uses two different Bloom filter types that store different information and that are located in front of and behind the PWM-PUF, improving security by removing challenges from attacker access. Simulation results show that the proposed structure decreases the data transmission error rate and reuse rate as the Bloom filter size increases, the simulation results also show that the proposed structure improves PWM-PUF security with a very small Bloom filter memory.

scholarly journals Route Prefix Caching Using Bloom Filters in Named Data Networking

2020 ◽  
Vol 10 (7) ◽  
pp. 2226
Author(s):  
Junghwan Kim ◽  
Myeong-Cheol Ko ◽  
Jinsoo Kim ◽  
Moon Sun Shin
Keyword(s):  
Bloom Filter ◽  
Bloom Filters ◽  
Experimental Result ◽  
Named Data Networking ◽  
Next Generation Internet ◽  
Complex Process ◽  
Caching Scheme ◽  
Name Lookup ◽  
Cache Miss ◽  
Data Networking

This paper proposes an elaborate route prefix caching scheme for fast packet forwarding in named data networking (NDN) which is a next-generation Internet structure. The name lookup is a crucial function of the NDN router, which delivers a packet based on its name rather than IP address. It carries out a complex process to find the longest matching prefix for the content name. Even the size of a name prefix is variable and unbounded; thus, the name lookup is to be more complicated and time-consuming. The name lookup can be sped up by using route prefix caching, but it may cause a problem when non-leaf prefixes are cached. The proposed prefix caching scheme can cache non-leaf prefixes, as well as leaf prefixes, without incurring any problem. For this purpose, a Bloom filter is kept for each prefix. The Bloom filter, which is widely used for checking membership, is utilized to indicate the branch information of a non-leaf prefix. The experimental result shows that the proposed caching scheme achieves a much higher hit ratio than other caching schemes. Furthermore, how much the parameters of the Bloom filter affect the cache miss count is quantitatively evaluated. The best performance can be achieved with merely 8-bit Bloom filters and two hash functions.

scholarly journals Quality Assessment of Tire Shearography Images via Ensemble Hybrid Faster Region-Based ConvNets

Electronics ◽  
2019 ◽  
Vol 9 (1) ◽  
pp. 45 ◽  
Author(s):  
Chuan-Yu Chang ◽  
Kathiravan Srinivasan ◽  
Wei-Chun Wang ◽  
Ganapathy Pattukandan Ganapathy ◽  
Durai Raj Vincent ◽  
...  
Keyword(s):  
Neural Networks ◽  
Quality Assessment ◽  
Convolutional Neural Networks ◽  
False Positive ◽  
High Performance ◽  
Learning Approaches ◽  
Positive Ratio ◽  
False Positive Ratio ◽  
Proposed Model ◽  
Human Eyes

In recent times, the application of enabling technologies such as digital shearography combined with deep learning approaches in the smart quality assessment of tires, which leads to intelligent tire manufacturing practices with automated defects detection. Digital shearography is a prominent approach that can be employed for identifying the defects in tires, usually not visible to human eyes. In this research, the bubble defects in tire shearography images are detected using a unique ensemble hybrid amalgamation of the convolutional neural networks/ConvNets with high-performance Faster Region-based convolutional neural networks. It can be noticed that the routine of region-proposal generation along with object detection is accomplished using the ConvNets. Primarily, the sliding window based ConvNets are utilized in the proposed model for dividing the input shearography images into regions, in order to identify the bubble defects. Subsequently, this is followed by implementing the Faster Region-based ConvNets for identifying the bubble defects in the tire shearography images and further, it also helps to minimize the false-positive ratio (sometimes referred to as the false alarm ratio). Moreover, it is evident from the experimental results that the proposed hybrid model offers a cent percent detection of bubble defects in the tire shearography images. Also, it can be witnessed that the false-positive ratio gets minimized to 18 percent.

Limits of the ‘Mini-Mental State’ as a screening test for dementia and delirium among hospital patients

1982 ◽  
Vol 12 (2) ◽  
pp. 397-408 ◽  
Author(s):  
James C. Anthony ◽  
Linda LeResche ◽  
Unaiza Niaz ◽  
Michael R. Von Korff ◽  
Marshal F. Folstein
Keyword(s):  
Mental State ◽  
False Positive ◽  
Mini Mental State Examination ◽  
False Negative ◽  
General Medical Ward ◽  
Positive Ratio ◽  
False Positive Ratio ◽  
Hospital Patients ◽  
Screen Instrument ◽  
State Examination

SynopsisWith a psychiatrist's standardized clinical diagnosis as the criterion, the ‘Mini-Mental State’ Examination (MMSE) was 87% sensitive and 82% specific in detecting dementia and delirium among hospital patients on a general medical ward. The false positive ratio was 39% and the false negative ratio was 5 %. All false positives had less than 9 years of education; many were 60 years of age or older. Performance on specific MMSE items was related to education or age. These findings confirm the MMSE's value as a screen instrument for dementia and delirium when later, more intensive diagnostic enquiry is possible; they reinforce earlier suggestions that the MMSE alone cannot yield a diagnosis for these conditions.

A Hybrid Approach for Accurate BT Traffic Identification

2010 ◽  
Vol 108-111 ◽  
pp. 279-284
Author(s):  
Ru Hui Zhang ◽  
Ye Du ◽  
Xing Wang ◽  
Zhong Lan Yuan
Keyword(s):  
False Positive ◽  
Hybrid Approach ◽  
Transfer Mechanism ◽  
Preliminary Evaluation ◽  
Traffic Identification ◽  
Positive Ratio ◽  
False Positive Ratio ◽  
Information Method ◽  
Flow Information ◽  
Encrypted Traffic

In this paper, a hybrid approach for identifying the traffic running over BitTorrent (BT) protocol is proposed. Besides the conventional port-based and signature-based methods, another two BT-oriented methods dealing with the peer-information and flow-information of BT traffic are also adopted. The peer-information method makes use of the unencrypted peer-transfer mechanism of BT protocol, and the flow-information method focuses on identifying the encrypted traffic, which evades the above three methods, with low false-positive ratio. The preliminary evaluation shows that our hybrid approach is effective and comprehensive for BT traffic identification.

Sign in / Sign up

Export Citation Format

Share Document