Analysis Operation NLSR With Ubuntu as NDN Router

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.

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.

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.

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.

With the expansion of the network scale, especially in the case of frequent movement of network nodes, the network topology of the wireless ad hoc network also changes frequently, so more efficient routing becomes a research hotspot of large-scale networks. The design of inter-domain and intra-domain routing protocols in regional routing protocols has a huge impact on network performance. Due to the large overlap of intra-domain area of hybrid routes, large routing overhead and repeated pathfinding between domains, this paper improves the intra-domain routing mechanism and intra-domain routing mechanism of the traditional ZRP protocol based on the large-scale wireless ad hoc network of high-speed mobile scenarios. Different from other protocols to optimize the routing mechanism itself, this paper will establish a multi-center intra-domain routing area based on the neighbor connection degree in order to greatly reduce network overhead. And it establishes adaptive routing based on link quality in the inter-domain routing mechanism. This paper analyzes the performance of the improved routing protocol NA-ZRP through NS2 simulation. The results show that the NA-ZRP protocol can better adapt to the large-scale high-speed mobile wireless ad hoc network scenario than the traditional ZRP.

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 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 (NDN) is the most promising architecture in the future Internet. NDN ensure high availability of contents and security of the data packet. However, it may disturb the stability and security in NDN routing such as Interest Flooding Attack (IFA). There are many existing detection and mitigation technique about IFA which labelled a non-collusive type of routing threats where it causes the PIT resources to exhausted and legitimate request could not perform in communication. Unfortunately, all the existing counter-measure mechanism could not defend the Collusive Interest Flooding Attack (CIFA). The attacks initiated with a satisfying interest and malicious data producer will reply to the corresponding request before the expiry of existing PIT entries in NDN router along the path. CIFA is classified as low rate intermittent attack which is very difficult in distinguish with legitimate requests. Thus, CIFA is more vulnerable and threatens than previous NCIFA. Moreover, there is no benchmark datasets or any public datasets to perform further experiments on detecting CIFA. Thus, there is a need to produce reliable datasets for future investigation in detection or mitigation relevant attacks in NDN.

Among the distinctive features of the Named Data Networking (NDN) paradigm, in-network caching plays a crucial role in improving data delivery performance. At the network edge, the benefits of in-network caching can be remarkable in terms of reduced network traffic and user-perceived access latency. Multiple strategies have been designed for caching static Internet contents in NDN routers, while less attention has been devoted to transient Internet of Things (IoT) data, which expire after a certain amount of time. In this work, we introduce a novel distributed and autonomous caching strategy where NDN nodes take decisions by considering the popularity of IoT data and their lifetime. The target is to cache the most popular data with the highest residual lifetime in order to maximize the cache hit ratio at the edge. Performance evaluation assessed with the ndnSIM network simulator shows that the proposed solution outperforms existing schemes available in the literature by guaranteeing, among others, the highest cache hit ratio and the shortest content retrieval time.

The Named-data Link State Routing protocol (NLSR) is an intra-domain routing protocol for Named Data Networking (NDN). It is an application level protocol similar with many IP routing protocols, but NLSR uses NDN's Interest/Data packets to disseminate the routing updates, directly benefit from NDN's built-in data authenticity. The security mechanism has been directly embedded inside the NDN protocol, thus a digital signature scheme is needed to check the integrity of each NLSR packets that exchanged between node that run NLSR. By default, NLSR uses RSA and ECDSA as digital signature algorithms that are proven to be efficient against attacks, but both have their respective advantages and disadvantages due to differences in computation and key methods used. The main purpose of our research was to find the optimal algorithm that give the best synchronization time during the signature scheme. Our experiment result show that RSA scheme performance speed is better than ECDSA scheme on NLSR in sync speed with 0.062558226% difference.

Enhancing NDN feasibility via dedicated routing and caching

As a leading architecture of Information-Centric Networking (ICN), Named Data Networking (NDN) plays an important role in the future network construction. NDN retrieves and identifies a data packet according to the packet's name instead of its IP address. Conventional protocols of TCP/IP Internet are unsuitable for NDN. Therefore, Named-data Link State Routing protocol (NLSR) is proposed as an intra-domain routing protocol for NDN. Although NLSR applies a five-layer trust model to guarantee its data security, there are still a lot of security issues in its data access mechanism, such as the fake and leakage of data. In this paper, we apply Communicating Sequential Processes (CSP) to formalize this mechanism. Using Process Analysis Toolkit (PAT), we verify four properties, including deadlock freedom, data availability, data security and data decryption. According to the verification results, the trust model cannot protect the data from fake and leakage once intruders appear. We adopt a method similar to digital signature in the first improved model. However, the process of obtaining keys still needs to be executed multiple times during the verification of a data packet. To further accelerate the key fetching and verification process, all the keys, needed to validate a data packet, are packaged in a special packet of the second improvement.

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.

An efficient routing protocol is needed in transmitting data on the network, especially on Named Data Network. This means that the routing mechanism must be made in such a way that the data transmission rate is close to the transmission link rate. This study investigates the effect of a geographic-based routing protocol compared to the link state from an efficiency point of view. The system model is built to see the effect of link bitrate, path stretch, packet header, and packet size on the efficiency of the routing protocol in sending data. From the mathematical model, Link State routing is outperformed geographic routing protocol for 24% on average.

Named Data Networking (NDN) has a built-in caching capability that is enabled with the help of its Content Store. Caching in NDN has several benefits, such as reducing overhead on the producer side, avoiding a single point of failure, and reducing network load. The primary caching policy of the NDN architecture is to leave copies everywhere. However, this scheme induces significant cache redundancy. Existing advanced cache techniques either periodically share the entire list of cached content at a node or make a caching decision without knowing the cached content at other nodes in the network. We propose an intelligent cache policy that estimates cache distribution and topology through a collaborative network of NDN routers, guided by Interest and Data packets. Additionally, we develop an NDN simulator to facilitate the testing and evaluation of our machine learning caching strategy. This paper details the cache policy, the design and functionality of our NDN simulator, and the experiments comparing our approach to baseline caching strategies.