FCTree: A Space Efficient FIB Data Structure for NDN Routers

Named data networking (NDN) is a future Internet architecture that directly emphasizes accessible content by assigning each piece of content a unique name. Data transmission in NDN is realized via name-based routing and forwarding. Name-based forwarding information base (FIB) usually has much more and longer prefixes than IP-based ones, and therefore, name-based forwarding brings more challenges on the NDN router in terms of high forwarding throughput, low memory consumption, and fast FIB update. In this paper, we present an index data structure called BFAST for the name-based FIB. BFAST is designed based on a basic hash table, it employs a counting Bloom filter to balance the load among hash table slots, so that the number of items in each non-empty slot is close to 1, leading to low searching time in each slot. Meanwhile, the first-rank-indexed scheme is proposed to effectively reduce the massive memory consumption required by the pointers in all the hash table slots. Evaluation results show that, for the longest prefix match FIB lookup, BFAST achieves a speed of 2.14 MS/S using one thread, and meanwhile, the memory consumption is reasonably low. By leveraging the parallelism of today’s multi-core CPU, BFAST arrives at an FIB lookup speed of 33.64 MS/S using 24 threads, and the latency is around $0.71~\mu s$ .

Named data networking is a new communication paradigm for the future networking architecture, which shifts the networking from a host-oriented architecture to an information-centric one. Its data transmission is realized via name-based routing and forwarding. This, however, brings severe challenges to the scalability of the forwarding information base (FIB) because the name space is infinite and can be several orders of magnitude larger than the IP counterpart. This letter tries to mitigate the FIB explosion problem and achieve high-speed forwarding by adding route cache to the FIB design. We proposed two approaches to tackle the cache hiding problem rooted from the longest prefix matching on names of arbitrary length: the atomic caching that groups multiple overlapping prefixes as a unit for cache operation, and the on-the-fly caching that caches only the most specific prefixes. Trace-driven simulation using an HTTP request trace from China Mobile demonstrated the feasibility and effectiveness of our design.

Named Data Networking (NDN) is a new network architecture derived from the success of the Internet. Specifically, NDN addresses and identifies data by naming. Source and destination host addresses are not required for data communication in the NDN because the data is uniquely named instead. In the NDN network, the Forwarding Information Base (FIB) table is responsible for data forwarding, the Pending Interest Table (PIT) is liable for holding the state of data forwarding process, and the Content Store (CS) is used to stock data chunks within the network to optimize the forwarding time to the data without contacting to the content producer. All these data structures consume the memory of devices existing in the Named Data Networking of Things (NDNoT). Accordingly, the size of the FIB, PIT and CS needs to be carefully adjusted in NDNoT environments for performance tuning and Quality of Service (QoS) provisioning. In this study, we explore the issues of FIB sizing on average and maximum occupancy, reliability and maximum delay for constant bit rate (CBR) traffic where each content producer is addressed with a prefix name in the Cooja simulator environment. The results indicate that FIB table size has an impact on the reliability and maximum delay. During the number of records in FIB outpaces the count of nodes in the network, the reliability decreases gradually. Therefore, in constrained NDNoT environment careful allocation of the memory among FIB, PIT and CS becomes an important issue. According to our knowledge so far, this work is the first study showing the effect of FIB table on the performance in an NDNoT environment.

This paper proposes an IP forwarding information base (FIB) encoding leveraging an emerging data structure called a learned index , which uses machine learning to associate key-position pairs in a key-value store. A learned index for FIB lookups is expected to yield a more compact representation and faster lookups compared to existing FIBs based on tries or hash tables, at the cost of efficient FIB updates, which is difficult to support with a learned index. We optimize our implementation for lookup speed, exploiting that for efficient FIB lookups it is enough to approximate the key-position pairs with a piece-wise linear function, instead of having to learn the key-position pairs. The experiments using real BGP routing information snapshots suggest that the size of the proposed FIB is compact and lookup speed is sufficiently fast regardless of the length of matched prefixes.

Named data networking (NDN) supports receiver-driven content retrieval with stateful forwarding (pending interest table (PIT)/forwarding information base) and in-network caching, yet many deployments still rely on classical cryptography that may be undermined by quantum-capable adversaries. Despite NDN’s built-in data authenticity via producer signatures, quantum-enabled attacks become plausible once RSA/ECC-based trust anchors are weakened by Shor-type attacks. Existing quantum-security efforts for NDN largely focus on post-quantum replacements of signatures or key exchange, but do not address the tension between confidentiality-preserving payload protection and NDN’s in-network processing (forwarding/caching decisions) in a quantum setting. This paper presents a quantum-enhanced NDN architecture that preserves NDN’s content-centric semantics—naming, PIT-driven forwarding, and cache-assisted dissemination of verifiable control objects—while delivering privacy-sensitive payloads as quantum homomorphic encryption (QHE)-encrypted quantum states over an underlying quantum network. QHE provides end-to-end confidentiality and enables authorized operations on encrypted quantum payloads without exposing plaintext. To make the design compatible with NDN forwarding, the proposed protocol encrypts the payload while keeping name-based forwarding semantics intact, and supports ciphertext-domain processing for selected policy functions. To protect provenance and integrity of NDN metadata, routing instructions, and session state, we incorporate quantum digital signatures (QDS) bound to NDN names and session identifiers. The main contributions are: (i) a QHE+QDS layered protection model tailored to NDN’s Interest and Data exchange; (ii) a session workflow that couples proactive entanglement distribution with NDN-style stateful signaling for efficient establishment and recovery; and (iii) a security analysis clarifying the achieved guarantees and the remaining trust assumptions. Security analysis indicates robustness against quantum man-in-the-middle and tampering attacks, with modest overhead on NDN control traffic.

This paper investigates the issue of multi-hop forwarding in Vehicular Ad hoc Networks (VANETs), which is suffering from rapidly changing topology, short-lived and intermittent connectivity. Designed to replace TCP/IP using named data, Named Data Networking (NDN) has natural advantages to greatly overcome those challenges because of its multi-source and in-network caching characteristics. However, in the wireless environment the Interest and Data, proposed in NDN, are usually flooded because of the absence of Forwarding Information Base (FIB). To tackle this problem, we propose HVNDN, a hybrid forwarding strategy through NDN. More specifically, HVNDN introduces opportunistic and probabilistic forwarding strategy for location-dependent and location-independent information, respectively, which takes full advantage of geographic information and the characteristics of named data in VANETs. To make Vehicle-to-Vehicle (V2V) communication more effective and reliable, we design elaborate Interest and Data packets formats, retransmission and acknowledgement mechanism in HVNDN. Simulation results from NS-3 demonstrate that the proposed forwarding strategy outperforms the state-of-art scheme with less end-to-end delay and overhead.

In Named Data Networking (NDN), there is a need for routing protocols to populate Forwarding Information Base (FIB) tables so that the Interest messages can be forwarded. To populate FIBs, clients and routers require some routing information. One method to obtain this information is that network nodes exchange routing information by each node advertising the available content objects. Bloom Filter-based Routing approaches like BFR [1], use Bloom Filters (BFs) to advertise all provided content objects, which consumes valuable bandwidth and storage resources. This strategy is inefficient as clients request only a small number of the provided content objects and they do not need the content advertisement information for all provided content objects. In this paper, we propose a novel routing algorithm for NDN called pull-based BFR in which servers only advertise the demanded file names. We compare the performance of pull-based BFR with original BFR and with a flooding-assisted routing protocol. Our experimental evaluations show that pull-based BFR outperforms original BFR in terms of communication overhead needed for content advertisements, average roundtrip delay, memory resources needed for storing content advertisements at clients and routers, and the impact of false positive reports on routing. The comparisons also show that pull-based BFR outperforms flooding-assisted routing in terms of average round-trip delay.

The proposed Internet paradigm The Flying Ad Hoc Network (FANET), Named Data Network (NDN), and Software Defined Network (SDN) have attracted the interest of the scientific community. The TCP/IP protocol is the present Internet standard, while NDN is the future internet architecture that builds on it. Data availability is improved via NDN, which substitutes named data for the nodes' addresses. SDN is a good option for communicating effectively, utilizing resources effectively, and supporting developing technologies. The SDN has attracted interest because of its high-level programmability and flexibility. Numerous applications in the military, business, and civil sectors make extensive use of FANE T. The broadcast characteristic of NDN causes an issue known as a broadcast storm in dense FANET environments. The issue is caused by duplicate packets, which raises the overall amount of traffic and retransmissions. FANET has a problem with the timely and quick transmission of essential packets. In this paper, we suggested a new scheme named "Novel Adaptive Broadcast Storm Avoidance (NABA)" for SDN and NDN-enabled FANET, which uses a controller to lessen the broadcast issue. Our scheme made use of the SDN controller's effective flow management to regulate the broadcast storm and facilitate packet transfers. Additionally, we divided up the packet into categories based on priority. The priority of the packet is determined by the naming criterion. In terms of the overall number of Interests and content retrieval time, the findings show that NAB A performs better than native NDN floods.

Named Data Networking (NDN) is an implementation of Information-Centric Networking (ICN) that has emerged as a promising candidate for the Future Internet Architecture (FIA). In contrast to traditional networking protocols, NDN’s focus is on content, rather than the source of the content. NDN enables name-based routing and location-independent data retrieval, which gives NDN the ability to support the highly dynamic nature of mobile networks. Among other important features, NDN integrates security mechanisms and prioritizes protecting content over communication channels through cryptographic signatures. However, the data verification process that NDN employs may cause significant delays, especially in mobile networks and vehicular networks. This aspect makes it unsuitable for time-critical and sensitive applications such as the sharing of safety messages. Therefore, in this work, we propose NDN-BDA, a blockchain-based decentralized mechanism that provides a faster and more efficient data authenticity mechanism for NDN-based vehicular networks.

The large expansion in network services and applications seen in the last few years requires new network architectures to satisfy an increasing number of users and enhance content delivery. Named Data Networking (NDN) has recently appeared as a new paradigm to solve many shortcomings in the current TCP/IP architecture. Its main characteristics like stateful forwarding and in-network caching made NDN networks an efficient environment for data delivery where the data is retrieved based on content names rather than IP addresses. The NDN, by its nature, defends against the well-known Distributed Denial of Service (DDoS) attacks that take place in the traditional TCP/IP architecture. However, a special kind of DoS attack called Collusive Interest Flooding Attack (CIFA) has appeared to overwhelm the resources of NDN routers by filling their Pending Interest Tables (PIT) with long-lasting malicious entries. The network throughput and consumer satisfaction rate are highly affected by CIFA. A lightweight yet efficient stateless CIFA detection algorithm is proposed in this research utilizing the non-parametric CUSUM algorithm; a change point detection approach that detects the point in time when a transition occurs in the network. The proposed algorithm is characterized by its low computational overhead, highly accurate detection, and quick response. To detect the malicious name prefixes and eliminate the CIFA effect, a mitigation algorithm that uses the average response time vales of all name prefixes is proposed in this research. Experimental results show that this approach detects CIFA after 199.5 ms from when an attack is launched in the large-scale topology. In addition, the mitigation approach effectively reduces the PIT utilization and increases the average consumer satisfaction rate.

Named Data Networking (NDN) presents strong bandwidth benefits on edge networks because its in-network caching design is probably fit for popularity and locality. However, separate NDN edge regions cannot be efficiently connected over IP backbone world, slowing down the deployment of NDN edges. Due to the difference of stateful NDN and stateless IP in forwarding principles, the coexistence of two protocols is difficult and challenging in the network layer. In this paper, we propose iGate, an NDN gateway design for tunneling over IP world, to bridge two kinds of protocols in the same layer. iGate translates protocols between stateful NDN and stateless IP by two temporary tables. It considers many factors about gateway efficiency, like table tunning, minimal NDN integration, TCP/UDP alternatives. We evaluate the performance of iGate with a real implementation on Linux and the results show that it can achieve more than 85.03% translation efficiency and less than 29% protocol conversion delay compared with IP VPN which uses the typical tunneling technology over IP network. Our work presents a practical and highly-efficient solution to assemble NDN edges into IP world, and can be applied to other similar Information-Centric Networking (ICN) designs.

A blockchain-based architecture for secure vehicular Named Data Networks

Current Internet architecture is based on the TCP/IP model and has been developed several years ago. So far, it is the main architecture used in different fields of science and technology. This architecture however may need to be reconstructed to fulfill future aims and domains, such as connected vehicles, which is our field of study. For this reason, we suggest in this paper a comparison of the current architecture with NDN (named data networking), a future Internet architecture, in order to help the reader distinguish the characteristics of the two architectures, and thus choosing the best one depending on his field of study.

The current Internet infrastructure, initially conceived to provide closed group connectivity to a limited user-base, is now facing the challenges of catering to over three billion users with dynamically changing data, transport, and access requirements. Content-Centric Networking (CCN) is being explored as a possible future Internet architecture. Named-Data Networking (NDN) exemplifies CCN and with the ever-changing security landscape, it is imperative to build it with intrinsic resilience based on the security by design narrative. In this extended abstract, we explore the fake interest fiooding by adversaries to launch a Distributed Denial of Service (DDoS) attack in NDN. We propose Kiram as an intelligent anomaly recognition and alert generation mechanism serving as a collaborative countermeasure to a DDoS attack. The alert generated by Kiram is named Warding Off Evil (WOE). This poster presents results establishing the effectiveness of Kiram based on substantial simulations over a fairly realistic topology.

Named Data Networking (NDN) is a newly proposed next-generation Internet architecture that uses the name of data to forward and route packets. As a potential candidate for future Internet architecture, it is crucial to address the security and privacy issues in NDN. NDN is vulnerable to a new type of Distributed Denial of Service (DDoS) attacks called Interest Flooding Attacks (IFAs). The attackers can send a massive amount of Interest requests to overwhelm the Pending Interest Table (PIT) at routers resulting in network disruption for legitimate users. In this paper, we propose a Binary Tree-Based Interest Flooding Attack Detection and Mitigation Scheme (BTIFADMS) to protect NDNs. The proposed scheme allows each NDN router to use binary trees to detect IFAs and mitigates IFAs by limiting the number of Interest requests forwarded from the contaminated routers. The simulation evaluation shows that BTIFADMS can quickly and accurately identify and respond to the IFAs in the NDNs.