A Perspective Towards NCIFA and CIFA in Named-Data Networking Architecture

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.

Detecting interest flooding attacks in NDN: A probability-based event-driven approach

The Named Data Network (NDN) is a future network architecture to transit conventional host-centric networks into data-centric networks. A routing attack, represented by Interest Flooding Attack (IFA), is a major security concern in NDNs. IFAs seriously harm NDNs by sending excessive fallacious Interest packets to overwhelm the routers to serve legitimate users. It is easy to launch, but difficult to defend, especially when legitimate Interest packets are blended with the IFAs as bIFAs. In this paper, we propose an accurate approach to detect and mitigate IFAs and bIFAs, named Accurate Detection and Mitigation of Blended Interest Flooding Attacks (ADMBIFA). It utilizes fuzzy logic to detect IFAs and bIFAs. And then it identifies malicious Interest prefixes with K-means. Finally, it restrains attackers to mitigate the damage to the networks. The simulation results show that the ADMBIFA is very sensitive to detect attacks with an ability to mitigate IFAs and bIFAs. And it can effectively reduce the negative impacts on NDNs.

Internet of Things (IoT) allows all entities such as computing devices, machines, objects, people, etc., to interact with each other through their Internet Protocol (IP) addresses without human intervention. Consequently, IP addresses are being exhausted rapidly. Named-Data Networking (NDN) tends to transit the conventional host-centric network into the data-centric network. However, routing attacks such as Interest Flooding Attack (IFA) is a primary security concern. To date, far too little attention has been paid to classify the IFA detection mechanisms and further identify the key points to design an efficient detection technique. This study aimed to conduct a comprehensive survey of state-of-the-art IFA detection mechanisms and analysed the algorithms used. In this paper, we summarize the different types of possible attack models with a specific name with a description in NDN, specifically the PIT-oriented routing attack. Besides, we classified these mechanisms into nine categories with its topology used, analogy metrics and attack focus. Finally, we have highlighted and provide recommendations in some critical pieces of architecture in detection mechanism design as future challenges to secure the IoT data from IFA in NDN.

Named Data Networking (NDN) has emerged as a promising information-centric networking paradigm that addresses the limitations of the traditional IP-based Internet architecture. The core principle of NDN relies on content naming instead of host addressing, to provide efficient, secure, and scalable content delivery. Routing is a critical component of NDN and is responsible for discovering and maintaining optimal paths to named content. This paper presents a comprehensive review of routing techniques in NDN, focusing on the design principles, algorithms, and performance metrics, especially in wired network architecture. We first summarize the NDN architecture and discuss its key components. We then delve into the fundamental routing concepts in NDN and categorize and examine various routing techniques, including link state, distance vector, and centralized approaches based on Software Defined Network. We also summarize the relevant research efforts proposed to address NDN routing challenges by focusing more on wired network architecture. Finally, we identify open research issues and future directions in NDN routing, emphasizing the need for scalable, efficient, and secure routing techniques that can fulfill the growing demands of the modern Internet. In conclusion, this review serves as a valuable reference for researchers and practitioners in NDN, offering a comprehensive understanding of the current state-of-the-art routing techniques, limitations, and potential future advancements.

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.

Named Data Networking (NDN) need routing to build NDN systems. Similar IP protocol, NDN has routing protocols intra-domain and inter-domain routing protocol. Named-data Link State Routing (NLSR) is one of the NDN intra-domain routing protocols in NDN. Deployment NLSR on actual hardware and operating systems give more performance feedback which might not be obtained in a simulation. This paper explain how a NLSR work and performance use Ubuntu installed as NDN router.

With information becoming a first-class citizen on the Internet, information-centric networking (ICN) is considered as a promising direction for the future Internet. Named data networking (NDN) is a prominent example of emerging ICN architectures. Unfortunately, NDN is vulnerable to various attacks targeting its in-network caching mechanism. In this paper, we focus on the false-locality pollution attack, in which an adversary repeatedly requests a number of unpopular data objects to waste the precious cache space on the NDN router and to reduce normal users’ hit ratios. With simulation experiments, we show that such an attack can cause considerable damage to the NDN network. To detect and mitigate such an attack, we introduce an algorithm that exploits the diversity of the Interest traversing paths within an Internet service provider’s point-of-presence network. We also propose inexpensive methodologies based on the probabilistic counting and Bloom filter techniques to implement the algorithm on an NDN router. The experimental results indicate that our proposed algorithm is effective in thwarting false-locality pollution. We also experiment with strategies that the adversary may utilize against our antipollution algorithm and demonstrate that such strategies are either ineffective or impractical in the real world.

At this time forwarding strategy became the center of attention of researchers in area named data networking (NDN). This is because the forwarding strategy is responsible for managing every packet of interest received by the NDN router, then the characteristics of forwarding strategies will have a significant impact on NDN performance. Therefore this study aims to perform analysis using a large approach in forwarding strategy that is broadcast approach. It is expected that the results of this study can be utilized by researchers in the field of NDN to determine the direction of research. Parameter of study in this research is delay in observation time interval. A forwarding strategy using a broadcast approach is simulated in order to understand the NDN delay characteristics within the observation interval. The simulation of the research was conducted on the NDNSim simulator with several scenarios. From the simulation results obtained that cumulatively delay broadcast forwarding strategy in multi producer scenario there is no difference between fulldelay and lastdelay. However, in the single producer scenario there is a difference between fulldelay and lastdelay this can be influenced by the large number of consumers who send interest to the producer and also based on the flooding method of the interest package in order to find the nearest NDN router containing the expected content as soon as possible, So that it can overload the network performance and effects overhead.

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

To provide seamless mobility support for the User in NDN (Named Data Networking) based cloud storage service, we propose a proxy based mobility support approach, called PMNDN. In this approach, we first introduce an ID that is structurally similar to the content name, to maintain the routing scalability of NDN architecture, and improve the addressing efficiency of INTEREST packet for NDN-based cloud storage service. Then, we deploy a new functional entity named Proxy, which is responsible for maintaining the reach-ability state of the User. We also extend the basic functionalities of the NDN Access Routers, such as tracking the mobility status of the User and initiating the handoff related signaling to the Proxy. With that, the User avoids participation in mobility signaling exchange. Finally, we construct an elastic 3-layer network analysis model, and compare the handoff performance of the mobility support approaches with that in NDN architecture and IPv6 architecture via analytical and simulation investigation. Our results indicate that not only PMNDN has lower handoff cost, it also has shorter handoff latency and less packet losses during the handoff process.

In this paper, we study the source mobility problem that exists in the current named data networking (NDN) architecture and propose a proxy-based mobility support approach named PMNDN to overcome the problem. PMNDN proposes using a proxy to efficiently manage source mobility. Besides, functionalities of the NDN access routers are extended to track the mobility status of a source and signal Proxy about a handoff event. With this design, a mobile source does not need to participate in handoff signaling which reduces the consumption of limited wireless bandwidth. PMNDN also features an ID that is structurally similar to the content name so that routing scalability of NDN architecture is maintained and addressing efficiency of Interest packets is improved. We illustrate the performance advantages of our proposed solution by comparing the handoff performance of the mobility support approaches with that in NDN architecture and current Internet architecture via analytical and simulation investigation. We show that PMNDN offers lower handoff cost, shorter handoff latency, and less packet losses during the handoff process.

Named data networking (NDN) is an emerging information-centric networking paradigm, in which the Internet of Things (IoT) achieves excellent scalability. Recent literature proposes the concept of NDN-IoT, which maximizes the expansion of IoT applications by deploying NDN in the IoT. In the NDN, the security is built into the network by embedding a public signature in each data package to verify the authenticity and integrity of the content. However, signature schemes in the NDN-IoT environment are facing several challenges, such as signing security challenge for resource-constrained IoT end devices (EDs) and verification efficiency challenge for NDN routers. This article mainly studies the data package authentication scheme in the package-level security mechanism. Based on mobile edge computing (MEC), an efficient certificateless group signature scheme featured with anonymity, unforgeability, traceability, and key escrow resilience is proposed. The regional and edge architecture is utilized to solve the device management problem of IoT, reducing the risks of content pollution attacks from the data source. By offloading signature pressure to MEC servers, the contradiction between heavy overhead and shortage of ED resources is avoided. Moreover, the verification efficiency in NDN router is much improved via batch verification in the proposed scheme. Both security analysis and experimental simulations show that the proposed MEC-based certificateless group signature scheme is provably secure and practical.

Named Data Networking (NDN) is one of the strong competitors of the next generation network architecture, meeting the needs of today’s users for the network. One problem with NDN is that the content requester does not know if there is any content in the network when it sends out the interest package, and it does not know where the target is. This problem is currently solved by the domain name resolution service, but the existing solution does not apply to the NDN architecture. Because the content in the NDN is identified by a human-readable name, the NDN architecture does not require an additional name resolution system. In this paper, we propose a blockchain-based Content Name Search Mechanism (BCNSM) by binding the content producer and the human-readable content name as the unique identifier of the content, and then using the blockchain as a trusted organization to store content information, and dynamically stores the information through the smart contract, thereby mapping the content name and the storage location to each other. BCNSM provides users with content name search services and name to the content provider resolution services. Then the model was built for the BCNSM using the colored petri net, and the model process is verified by the model simulation to meet the expectations, and the state space analysis proves that the BCNSM has no deadlock. Finally, a prototype of the smart contract was implemented in Ethereum’s testnet, and the storage and Gas overhead of content name registration and content cache address update were tested.

Software Defined Networking (SDN) and Named-Data Networking (NDN) are two new paradigms that aim at changing the way we design and architect computer networks. The NDN architecture was first proposed to solve the problems of current Internet Protocol (IP) communication. However, there is an important disadvantages in the existing NDN, which are the very large size of the NDN forwarding table and the huge overhead cost of the forwarding process. This may result in not only a slow delivery of data, but also in a lot of network traffics. For this reason, this architecture cannot be appropriately used in a large-scale network.To solve this problem, we proposed a novel forwarding Strategy for Named Data Networking based on SDN and bloom Filter (NDN-SF) in order to improve the efficiency of content delivery and enhance the consumption of network resources. Our experimental results showed that latency and bandwidth consumption are reasonably low in our method NDN-SF. They also demonstrated that the developed scheme is more efficient than the existing forwarding strategies in NDN.