Multipath Forwarding Strategies and SDN Control for Named Data Networking

In Named Data Networking (NDN), content can be retrieved from multiple sources through multiple path, which makes the traditional end-to-end congestion control mechanisms unsuitable for NDN. A lot of works have been done to achieve the congestion control by limiting the transmission rate of interest packets, but most of them overlooked the intelligent forwarding feature in NDN. In this paper, we propose a ratebased, multipath-aware congestion control algorithm MNRCP, which is inspired by Rate Control Protocol (RCP). MNRCP calculates the transmission rate for every flow and feedbacks it to the consumer to control the sending rate of interest packets. In order to fully exploit the features of multiple data sources, in-network caching and multipath forwarding and adapt to the practical scenarios that interest packets requesting the same data can arrive from different interfaces, we propose a novel multipath forwarding strategy and a multipath feedback mechanism to achieve fairness and network utilization. In addition, simulation results of our algorithm in ndnSIM2.3 show that compared with other congestion control mechanisms, MNRCP can achieve higher total throughput while ensuring fairness. According to the available bandwidth of the path, MNRCP also can achieve the optimal traffic split ratio, and thus performs better in load balancing.

An on-demand off-path cache exploration based multipath forwarding strategy

Named Data Networking is one of the most promising future Internet architectures with many advanced characteristics that are lacking in the existing TCP/IP-based Internet architecture. NDN features named content, built-in security, in-network caching, adaptive traffic routing, and multi-path forwarding. NDN can be used to mitigate traffic congestion and prioritize critical messages in both wired and wireless networks. It has particular advantages to deliver traffic over a disrupted and highly dynamic network environment because of its delay-tolerant and content-centric features. However, very few works have shown the real-world capacity of NDN over different types of network links. In this work, we benchmark the performance of NDN in various real network settings and make side-by-side comparisons with TCP/IP based approaches. We also demonstrate the strong capabilities of flexible forwarding strategies through prioritizing critical traffic over the network.

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) as a promising future network architecture has been attracted a lot of attention. In NDN, to keep fairness between flows and avoid congestion, one of the most important issues is the traffic control. Although some works have been done to solve the traffic control problem by controlling the sending/forwarding of Interest, to the best of our knowledge, the cooperation between traffic control and forwarding strategy is largely ignored. Therefore, to fill this gap, we propose an effective traffic control mechanism named Multi-path Flow Control(MFC) in this paper. Our proposal is the first to combine traffic control with multi-path forwarding strategy. In contrast with other traffic control mechanisms, MFC performs better in supplying different flows with fair service rates, enhancing network throughput and avoiding “Waiting Interest”, which is a unique problem in NDN. Finally, numerical simulation results based on ndnSIM platform are illustrated to show the performance of the proposed scheme.

A Responsibility-based Transport Control for Named Data Networking

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 Network (NDN) is a next-generation network architecture that shifts the traditional data communications paradigm Unlike conventional networks that rely on IP addresses, NDN delivers content based on data names rather than specific locations. In NDN, consumers express their requests by sending interest packets containing content names. These names are then propagated through the network nodes, which forward them to the appropriate destinations. The forwarding strategy in an NDN network plays a crucial role in ensuring efficient data delivery. This strategy includes a set of rules that determine the next hop for each interest packet. These rules are designed to optimize the forwarding process, minimizing delays and improving network efficiency. However, if the forwarding strategy is implemented without accurately identifying the appropriate face (i.e., the network interface) to forward interests toward the producer or the nearest cache node, it can lead to significant delays and packet drops. This, in turn, negatively impacts Quality of Service (QoS) parameters and the overall performance of the NDN network. This study applies supervised learning to classify consumer-requested interests to overcome this issue. This technique leverages several related variables to accurately classify these interests. The outcomes of the conducted research demonstrated that raw data from the mini-NDN output can be processed and transformed into a usable dataset. This data is then utilized to train a classification model with supervised learning. In a scenario with 9 NDN nodes and varying numbers of interests, distributed both uniformly and according to Zipf's law, the Random Forest model performs effectively, achieving an accuracy rate of 86.2% with an error rate of 14.8%.

Named Data Networking (NDN) is a recently designed Internet architecture that benefits data names instead of locations and creates essential changes in the abstraction of network services from "delivering packets to specific destinations” to "retrieving data with special names" makes. This fundamental change creates new opportunities and intellectual challenges in all areas, especially network routing and communication, communication security, and privacy. The focus of this dissertation is on the forwarding aircraft feature introduced by NDN. Communication in NDN is done by exchanging interest and data packets. Consumers send interest packets to request data, routers send them based on the data prefix name, and manufacturers respond with data packets exactly how interest is received. During this process, routers maintain information about the status of suspended interests. As regards NDN is still in its early stage, none of these strong efficiency features have done systematically designed, measured, or tracked in data retrieval and multi-path detection. This paper tries to improve transport performance by combining label switching with adaptive transport methods. For this purpose, in addition to RTT, another timer called T is used, an RTT factor for interface rating. And uses the BDP to choose the best interface to respond to interest. During this process, response time, throughput, and data recovery time are improved by 12%, 10%, and 5%, respectively.

In-network caching and multipath forwarding are prominent features of Named Data Networking (NDN). Network coding enabled NDN (NC-NDN) coordinates the in-network caching and multipath forwarding to improve content delivery performance. However, the existing NC-NDN lacks the considerations on the incorporation with caching schemes. It basically adopts the caching scheme of Caching Everything Everywhere (CEE) leading to cache redundancy and unnecessary and frequent cache replacement. On the other hand, the existing caching schemes for native NDN do not make use of the characteristic of network coded Data packets. To address these problems, this paper proposes a demand and responsiveness-based caching strategy specific to NC-NDN to enable cost-effective caching for network coded Data packets. In our proposed caching strategy, the caching decision at a caching node takes into account three factors, its present demand on the network coded Data packets of the requested generation of content, its distance to the original content provider, and its potential responsiveness to the future requests for the same generation based on the number of network coded Data packets locally cached and that would return for the requested generation. It commits to cache network coded Data packets of a generation of content at more valuable nodes along the transmission path. Our experimental studies show that the proposed caching strategy offers high-performance content delivery and reduces the caching overhead as compared to the existing strategies.

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.

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.

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.

Boosting named data networking for data dissemination in urban VANET scenarios

Named-Data Networking (NDN) is a novel clean-slate architecture for Future Internet. It has been designed to take into account a new use of the Internet and especially accessing content for a large number of users, and it integrates several features such as in-network caching, security or multipath. As NDN relies on content names instead of host address, it cannot rely on traditional Internet routing, and it is therefore essential to propose a routing scheme adapted for NDN. To this end, in this paper, we present SRSC, our SDN-based Routing Scheme for CCN/NDN and its implementation. SRSC relies on the SDN paradigm. A controller is responsible to forward decisions and to set up rules into NDN nodes. We implement SRSC into NDNx and we also deploy an NDN testbed within a virtual environment and real ISP topology in order to evaluate the performances of our proposal with real-world experiments. We demonstrate the feasibility of SRSC and its ability to forward Interest messages in a fully deployed NDN environment, while keeping low overhead and computation time and high caching performances.