scholarly journals I(FIB)F: Iterated bloom filters for routing in named data networks

2017 ◽  
Author(s):  
Cristina Munoz ◽  
Liang Wang ◽  
Eduardo Solana ◽  
Jon Crowcroft
Keyword(s):  
Bloom Filters ◽  
Data Networks

scholarly journals Efficient Lookup Solutions for Named Data Networks

2019 ◽  
Vol 9 (2S) ◽  
pp. 621-626
Keyword(s):  
Data Security ◽  
Bloom Filters ◽  
Data Networks ◽  
Hash Tables ◽  
Survey Paper ◽  
Memory Efficiency ◽  
Memory Overhead ◽  
Efficient Data ◽  
Longest Prefix Matching ◽  
Routing Tables

Named Data Networking (NDN) is afast growing architecture, which is proposed as an alternative to existing IP. NDN allows users to request the data identified by a unique name without any information of the hosting entity. NDN supports in-network caching of contents, multi-path forwarding, and data security. In NDN, packet-forwarding decisions are driven by lookup operations on content name of the NDN packets. An NDN node maintains set of routing tables that aid in forwarding decisions. Forwarding the NDN packets depend on lookup of these NDN tables and performing Longest Prefix Matching (LPM) against these NDN tables. The NDN names are unbounded and of variable length. These features along with large and dynamic NDN tables pose several challenges that include increased memory requirement and delayed lookup operations. To this end, there is a need for an efficient data structure that support fast lookup operations with low memory overhead. Several lookup techniques are proposed in this direction. Traversing trie structures would be slow since every level of trie require a memory access. Hash tables incur additional hash computations on names and suffer from collisions. Bloom filters suffer from false positives and do not support deletions. Improving the performance of these structures can lead to a better lookup solution.This survey paper explores different lookup structures for NDN networks. Performance is measured with respect to lookup rate and memory efficiency.

Creating a standard method of controlling digital microscopes: the microscope access protocol (map)

1995 ◽  
Vol 53 ◽  
pp. 16-17
Author(s):  
T. A. Dodson ◽  
E. Völkl ◽  
L. F. Allard ◽  
T. A. Nolan
Keyword(s):  
Data Storage ◽  
Storage Systems ◽  
Digital Systems ◽  
Data Networks ◽  
Digital Microscopy ◽  
Command Language ◽  
Access Protocol ◽  
Analog To Digital ◽  
Basic Physics ◽  
Scanning Electron

The process of moving to a fully digital microscopy laboratory requires changes in instrumentation, computing hardware, computing software, data storage systems, and data networks, as well as in the operating procedures of each facility. Moving from analog to digital systems in the microscopy laboratory is similar to the instrumentation projects being undertaken in many scientific labs. A central problem of any of these projects is to create the best combination of hardware and software to effectively control the parameters of data collection and then to actually acquire data from the instrument. This problem is particularly acute for the microscopist who wishes to "digitize" the operation of a transmission or scanning electron microscope. Although the basic physics of each type of instrument and the type of data (images & spectra) generated by each are very similar, each manufacturer approaches automation differently. The communications interfaces vary as well as the command language used to control the instrument.

Distributed Aggregation/Disaggregation Algorithms for Optimal Routing in Data Networks

1988 ◽  
Author(s):  
Wei K. Tsai ◽  
G. Huang ◽  
John K. Antonio ◽  
Wei-T. Tsai
Keyword(s):  
Data Networks ◽  
Optimal Routing

THE PROBLEM OF PROVIDING CACHE COHERENCE IN MULTIPROCESSOR SYSTEMS WITH MANY PROCESSORS

2018 ◽  
pp. 47-53
Author(s):  
B. Z. Shmeylin ◽  
E. A. Alekseeva
Keyword(s):  
Cache Coherence ◽  
Bloom Filters ◽  
Multiprocessor Systems ◽  
Cache Line ◽  
Maintenance Systems ◽  
Processor Caches ◽  
Conventional Systems ◽  
Additional Hardware

In this paper the tasks of managing the directory in coherence maintenance systems in multiprocessor systems with a large number of processors are solved. In microprocessor systems with a large number of processors (MSLP) the problem of maintaining the coherence of processor caches is significantly complicated. This is due to increased traffic on the memory buses and increased complexity of interprocessor communications. This problem is solved in various ways. In this paper, we propose the use of Bloom filters used to accelerate the determination of an element’s belonging to a certain array. In this article, such filters are used to establish the fact that the processor belongs to some subset of the processors and determine if the processor has a cache line in the set. In the paper, the processes of writing and reading information in the data shared between processors are discussed in detail, as well as the process of data replacement from private caches. The article also shows how the addresses of cache lines and processor numbers are removed from the Bloom filters. The system proposed in this paper allows significantly speeding up the implementation of operations to maintain cache coherence in the MSLP as compared to conventional systems. In terms of performance and additional hardware and software costs, the proposed system is not inferior to the most efficient of similar systems, but on some applications and significantly exceeds them.

Sign in / Sign up

Export Citation Format

Share Document