NDN Architecture Research Articles

A review of SDN‐enabled routing protocols for Named Data Networking

AbstractNamed Data Networking is a novel network architecture for the future internet in which data is named rather than addressed. This enables routers to forward data more efficiently based on its name, outperforming IP‐based routing. Another networking architecture that divides the control plane and the data plane is software‐defined networking (SDN). In an SDN network, the control plane decides on routing while the data plane forwards data packets. This separation increases routing flexibility and scalability. Numerous techniques to improve routing can be achieved with NDN and SDN integration. This paper provides an in‐depth examination of routing approaches in NDN based on SDN, emphasizing design principles, algorithms, and performance measures. We begin by summarizing the NDN architecture and delving into its essential components. We next go into the core routing ideas in NDN and categorize and study several routing solutions based on Software Defined Networks. Finally, we highlight the need for scalable, effective, and secure routing systems that may satisfy the expanding requirements of the contemporary internet. We also suggest open research topics in NDN routing based on SDN. This review provides an extensive overview of current centralized routing approaches in NDN, including their limitations and future possibilities.

Detection of DoS Attacks for IoT in Information-Centric Networks Using Machine Learning: Opportunities, Challenges, and Future Research Directions

The Internet of Things (IoT) is a rapidly growing network that shares information over the Internet via interconnected devices. In addition, this network has led to new security challenges in recent years. One of the biggest challenges is the impact of denial-of-service (DoS) attacks on the IoT. The Information-Centric Network (ICN) infrastructure is a critical component of the IoT. The ICN has gained recognition as a promising networking solution for the IoT by supporting IoT devices to be able to communicate and exchange data with each other over the Internet. Moreover, the ICN provides easy access and straightforward security to IoT content. However, the integration of IoT devices into the ICN introduces new security challenges, particularly in the form of DoS attacks. These attacks aim to disrupt or disable the normal operation of the ICN, potentially leading to severe consequences for IoT applications. Machine learning (ML) is a powerful technology. This paper proposes a new approach for developing a robust and efficient solution for detecting DoS attacks in ICN-IoT networks using ML technology. ML is a subset of artificial intelligence (AI) that focuses on the development of algorithms. While several ML algorithms have been explored in the literature, including neural networks, decision trees (DTs), clustering algorithms, XGBoost, J48, multilayer perceptron (MLP) with backpropagation (BP), deep neural networks (DNNs), MLP-BP, RBF-PSO, RBF-JAYA, and RBF-TLBO, researchers compare these detection approaches using classification metrics such as accuracy. This classification metric indicates that SVM, RF, and KNN demonstrate superior performance compared to other alternatives. The proposed approach was carried out on the NDN architecture because, based on our findings, it is the most used one and has a high percentage of various types of cyberattacks. The proposed approach can be evaluated using an ndnSIM simulation and a synthetic dataset for detecting DoS attacks in ICN-IoT networks using ML algorithms.

Mul-IBS: a multivariate identity-based signature scheme compatible with IoT-based NDN architecture

Mul-IBS: a multivariate identity-based signature scheme compatible with IoT-based NDN architecture

A source‐driven probabilistic forwarding and caching strategy in NDN and SDN‐based NDN

SummaryNDN forwarding strategies are mainly developed receiver‐driven, where Interest forwarding and Data (content) delivery are controlled from the consumers' viewpoint. The receiver‐driven strategies are greedy by nature and emphasize optimizing the Interest forwarding, which is far from the performance bottleneck as an Interest is of tiny size in compared with a content's size. Thus, optimizing the content delivery can improve the forwarding performance. Moreover, source‐driven optimization of content delivery can alleviate the greedy nature of its counterpart. In this work, a source‐driven forwarding strategy is proposed where the content sources respond to Interest requests in a distributed manner. The content requests hit all the sources, but the sources respond probabilistically such that the content retrieval overhead and latency are minimized. The strategy consents the nearer sources to set a high probability of reacting with the matching content. On the contrary, the distant sources answer with an Offer to save transmission overhead. Besides, a caching strategy is proposed, an integral part of the source‐driven scheme, that caches diverse contents considering the gap between successive copies and content availability while admitting new contents. Next, we extend the source‐driven probabilistic forwarding strategy to operate in SDN‐based NDN architecture. The SDN‐based solution controls the content delivery phase using the global knowledge of NDN cache states. Simulation study conducted using ndnSIM reveals that the proposed forwarding and caching strategy improves user satisfaction and network performance in terms of different performance metrics such as transmission overhead, latency, and cache hit.

Dynamic Interest Retransmission Interval Method for Congestion Control in NLSR

Named data link state routing (NLSR) protocol is widely used in current NDN architecture. Due to the limited bandwidth resources of NDN, in the large-scale network running NLSR, when routing information is frequently updated, resulting in a sudden increase in interactive information and the Interest storm is formed. It will cause congestion of protocol information flow and affect network quality and performance index. NLSR does not take corresponding control measures for its Interest traffic and transmission frequency. Therefore, we propose a method to solve this Interest storm: the exponential regression algorithm is used to dynamically adjust the retransmission interval of Sync Interest and the timeout retransmission Interest quantity detection method is provided to add the flow control. The simulation results show that the congestion control method can adjust the sending quantity and retransmission interval of Interest well according to the network traffic.

New Efficient Caching Strategy based on Clustering in Named Data Networking

<p>The Named Data Networking NDN is one of the most proposed architecture for the new model of Internet communications based on contents distribution, called Information-Centric Network ICN. It is widely accepted by the research community since it has become dominant in ICN design that resolves TCP-IP based Internet problems such as bandwidth, delay, location dependent and congestion. Based on location host IP addresses, TCP-IP designed for Peer-to-Peer communication P2P. NDN architecture is oriented Content Centric Networking CCN, where the data is stored on routers and distributed to users from the nearest router. Cache capacities of routers are limited compared to forwarded contents. To move from TCP-IP model to CCN model, many papers propose several new contents distribution based architecture ICN. In this paper, we propose a novel strategy to optimize the use of network resources inspired from Network clustering and cluster head selection in MANETs. Specifically, the improved K-medoids cluster algorithm is used to divide the global network in clusters, where for each cluster; three routers are selected as content routers. The first is the main caching router as well as the second and the third are the secondary caching router. The caching router selection process relies on three relevant criteria consisting of the distance between a node and its cluster centroid, the number of neighbors, and the congestion level. Two Multi Attribute Decision–Making methods MADM are applied, namely TOPSIS and AHP. Performance analysis of our proposed strategy with the established criteria showed � its effectiveness and strong potential.<em></em></p>

Optimized in-network authentication against pollution attacks in software-defined-named data networking

The exponential growth of multimedia content in today’s Internet traffic and the increasing need of bandwidth-consuming or location-independent services motivated the research community to design a viable replacement for the current IP-based Internet architecture. Named Data Networking or NDN is a novel network architecture that uses universal in-network caching and routing by name functionalities to deliver content efficiently and to improve service quality. Network coding benefits named data networking with its inherent algebraic structure and the maximum flow rates performance it achieves in multicast. With network coding, the content can be requested via multiple interfaces thus improving significantly content delivery efficiency. However, it is vulnerable to pollution attacks, which can cause a crucial degradation of network bandwidth. In this paper, we propose an efficient and optimized authentication technique for a content distribution NDN architecture based on network coding. Our solution uses homomorphic signature mechanism, which allows intermediate nodes to verify the authenticity of flows to overcome the pollution problem without having access to content. We formulate NDNAuth, an optimal coding and homomorphic signature scheme as a MIP problem. Furthermore, we show how to leverage Software Defined Networking to provide seamless implementation of the proposed solution. We measure the processing overhead and the dynamic system security state based on three metrics: (1) defence power; (2) threat severity and (3) system vulnerability. Finally, we discuss how to minimize the computational cost of coding and signature scheme operations. Experimentation results prove the efficiency of the proposed coding scheme, which achieves better performance than conventional NDN with random coding especially in terms of transmission cost and security.

An Overview of Security Support in Named Data Networking

This article presents an overview of the security mechanisms in the NDN architecture that have been developed over the past several years. NDN changes the network communication model from the delivery of packets to hosts identified by IP addresses to the retrieval of named and secured data packets. Consequently, NDN also fundamentally changes the approaches to network security. Making named data the centerpiece of the architecture leads to a new security framework that secures data directly, and uses name semantics to enable applications to reason about security and to automate the use of cryptographic keys. In this article, we introduce NDN's approaches to security bootstrapping, data authenticity, confidentiality, and availability.

Securing Named Data Networking: Attribute-Based Encryption and Beyond

As one of the promising information-centric networking (ICN) architectures, NDN has attracted tremendous research attention and effort in the past decade. In particular, security and privacy remain significant concerns and challenges due to the fact that most of the traditional cryptographic primitives are no longer suitable for NDN architecture. For example, the traditional cryptographic primitives aim to secure point-to-point communications, always requiring explicit descriptions of to where or whom the data packets are intended, while network addressing or locating in NDN becomes implicit. To deal with such issues, the recently developed cryptographic primitives such as ABE have been applied to NDN. Also, to efficiently solve the trust-roots problem and seamlessly deploy cryptographic infrastructures, the concept of SDN has been introduced to NDN as well. This tutorial is devoted to exploring the interesting integration between NDN, ABE, and SDN.

Federated Named Data Networking Testbed for Climate Science

Data discovery and distribution application that is utilized by climate, high energy physics, and other scientific communities are experiencing performance and large scale data managing problems, that are rooted from the shortcomings of IP architecture. To solve this problem, newly developed data managing applications based on NDN architecture were introduced. In this letter, we present the federated NDN testbed with an NDN-based climate science application and the set of experiments that reflect the performance of NDN based climate application in general with determined and applied optimization.

E-mail Application on Named Data Networking using Long Lived Interest

Background/Objectives: The current IP based internet architecture may not fulfill the needs of the future. The major problem being that the IP addresses are exhausting at a faster rate. Methods/Statistical Analysis: The proposed architecture for E-mail application on Named Data Networking uses SMTP and IMAP protocols to transfer mails over NDN. To enhance the overall performance, concept of long lived interest is used for implementing PUSH protocol for communication between the user agent and the servers. Further to retrieve the lost packets selective reject mechanism is used instead of the go back N mechanism. Findings: One major advantage of the NDN architecture is its Content Store. Content Store plays a vital role in minimizing the traffic in the network through the caching system. The major improvement in our E-mail application is the introduction of the concept of long lived interest. We have recorded our results by varying the number of mail segments. Results showed drastic performance improvement with long lived interest as the total number of packets is reduced drastically. We have measured performance by calculating the time required for the segments to reach the receiver mail server with and without the packet drops and by varying the number of mail segments. The results clearly indicate that the performance is better when there is no packet drops as there is no packet retransmission. Improvements/Applications: Packets from the mobile node takes longer time than the wired nodes because of the air medium interference, thus we intent to reduce the time taken to transfer packets in the mobile nodes.

The Second Named Data Networking Community Meeting (NDNcomm 2015)

This report is a brief summary of the second NDN Community Meeting held at UCLA in Los Angeles, California on September 28-29, 2015. The meeting provided a platform for the attendees from 49 institutions across 13 countries to exchange their recent NDN research and development results, to debate existing and proposed functionality in NDN forwarding, routing, and security, and to provide feedback to the NDN architecture design evolution.

The First Named Data Networking Community Meeting

This report is a brief summary of the first NDN Community Meeting held at UCLA in Los Angeles, California on September 4-5, 2014. The meeting provided a platform for the attendees from 39 institutions across seven countries to exchange their recent NDN research and development results, to debate existing and proposed functionality in security support, and to provide feedback into the NDN architecture design evolution.