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

scholarly journals On Sharing an FIB Table in Named Data Networking

2019 ◽  
Vol 9 (15) ◽  
pp. 3178
Author(s):  
Ju Hyoung Mun ◽  
Hyesook Lim
Keyword(s):  
Network Connectivity ◽  
Bloom Filter ◽  
Bloom Filters ◽  
Memory Requirement ◽  
Named Data Networking ◽  
Link State ◽  
Network Topologies ◽  
Forwarding Information Base ◽  
Forwarding Engine ◽  
Data Networking

As a new networking paradigm, Named Data Networking (NDN) technology focuses on contents, and content names are used as identifiers for forwarding and routing, as opposed to IP addresses in the current Internet. NDN routers forward packets by looking up a Forwarding Information Base (FIB), each entry of which has a name prefix and output faces. An FIB should have the information to forward Interest packets for any contents. Hence, the size of an FIB would be excessively large in NDN routers, and the traffic for building an FIB would be significant. In order to reduce the traffic associated with building an FIB table and memory requirement for storing an FIB table, this paper proposes a new efficient method which combines the routing of network connectivity and the building of a forwarding engine using Bloom filters. We propose to share the summary of an FIB using a Bloom filter rather than to advertise each name prefix. The forwarding engine of the proposed scheme is a combination of Bloom filters, and hence the memory requirement of the forwarding can be much smaller than the regular FIB. Simulation results using ndnSIM under real network topologies show that the proposed method can achieve nearly the same performance as the conventional link state algorithm with 6–8% of the traffic for distributing the connectivity information and 5–9% of the memory consumption.

Scalable Name Lookup with Adaptive Prefix Bloom Filter for Named Data Networking

2014 ◽  
Vol 18 (1) ◽  
pp. 102-105 ◽  
Author(s):  
Wei Quan ◽  
Changqiao Xu ◽  
Jianfeng Guan ◽  
Hongke Zhang ◽  
Luigi Alfredo Grieco
Keyword(s):  
Bloom Filter ◽  
Named Data Networking ◽  
Name Lookup ◽  
Data Networking

Spatial bloom filter in named data networking

2020 ◽  
Author(s):  
Filippo Berto ◽  
Luca Calderoni ◽  
Mauro Conti ◽  
Eleonora Losiouk
Keyword(s):  
Bloom Filter ◽  
Named Data Networking ◽  
Data Networking

Countermeasures of interest flooding attack in named data networking: A survey

2021 ◽  
pp. 002072092098351
Author(s):  
Linjun Yu ◽  
Huali Ai ◽  
Dong-Oun Choi
Keyword(s):  
Control Method ◽  
Network Architectures ◽  
Security Threats ◽  
Named Data Networking ◽  
Comprehensive Understanding ◽  
Next Generation Internet ◽  
Flooding Attack ◽  
Token Bucket ◽  
User Reputation ◽  
Data Networking

Named data networking (NDN) is a typical representation and implementation of information-centric networking and serves as a basis for the next-generation Internet. However, any network architectures will face information security threats. An attack named interest flooding attack (IFA), which is evolved, has becomes a great threat for NDN in recent years. Attackers through insert numerous forged interest packets into an NDN network, making the cache memory of NDN router(s) overrun, interest packets for the intended users. To take a comprehensive understanding of recent IFA detection and mitigation approaches, in this paper, we compared nine typical approaches to resolving IFA attacks for NDN, which are interest traceback, token bucket with per interface fairness, satisfaction-based interest acceptance, satisfaction-based push back, disabling PIT exhaustion, interest flow control method based on user reputation and content name prefixes, interest flow balancing method focused on the number of requests on named data networking, cryptographic route token, Poseidon local, and Poseidon distributed techniques. In addition, we conducted a simulation using Poseidon, a commonly used IFA resolution approach. The results showed that Poseidon could resolve IFA issues effectively.

scholarly journals A PEKS-Based NDN Strategy for Name Privacy

2020 ◽  
Vol 12 (8) ◽  
pp. 130
Author(s):  
Kyi Thar Ko ◽  
Htet Htet Hlaing ◽  
Masahiro Mambo
Keyword(s):  
Keyword Search ◽  
Content Delivery ◽  
Public Key ◽  
Public Key Encryption ◽  
Next Generation ◽  
Named Data Networking ◽  
Next Generation Internet ◽  
Network Cache ◽  
Data Networking

Named Data Networking (NDN), where addressable content name is used, is considered as a candidate of next-generation Internet architectures. NDN routers use In-Network cache to replicate and store passing packets to make faster content delivery. Because NDN uses a human-readable name, it is easy for an adversary to guess what kind of content is requested. To solve this issue, we develop a PEKS-based strategy for forwarding packets, where PEKS stands for public key encryption with keyword search. We implement the PEKS-based strategy based on the best route strategy and multicast strategy of NDN and show the performance of the PEKS-based NDN strategy. We also discuss the issues of the PEKS-based NDN strategy.

scholarly journals Name Lookup in Named Data Networking: A Review

Information ◽  
2019 ◽  
Vol 10 (3) ◽  
pp. 85 ◽  
Author(s):  
Al-qutwani Majed ◽  
Xingwei Wang ◽  
Bo Yi
Keyword(s):  
Alternative Model ◽  
Named Data Networking ◽  
Memory Consumption ◽  
Implementation Cost ◽  
Time Efficiency ◽  
Time Processing ◽  
Name Lookup ◽  
Future Work ◽  
Open Issues ◽  
Data Networking

Named data networking (NDN) is an alternative model to the current traditional IP-based Internet by improving content distribution in a network with content name. In NDN, content is sent/received based on its name rather than its address. Forwarding is still considered the bottleneck of NDN despite the effort in naming, routing, mobility, and security. NDN requires per-packet update that is preceded by a one-name lookup operation, which results in heavy time processing. The content names consume a large amount of memory, which causes the fast growth of NDN tables. To review the current solutions for NDN name lookup, this paper explores the existing NDN approaches and architectures by using a novel classification method. Furthermore, name lookup approaches were analyzed and compared in a novel manner. This survey highlighted the issues that affect name lookup performance in NDN, such as scalability, memory consumption, time efficiency, latency, and validity. We pointed out directions for future work and open issues to improve NDN name lookup in minimizing implementation cost and enhancing performance.

Sign in / Sign up

Export Citation Format

Share Document