Named Data Networking Architecture Research Articles

Advancing producer mobility management in Named Data Networking: A comprehensive analytical model

This paper introduces a transformative approach to managing producer mobility in Named Data Networking (NDN). It presents a novel analytical model known as Producer Mobility Management Model (PMMM) that significantly improves handoff latency, signalling cost, and packet delivery efficiency, overcoming limitations of traditional static anchor-based methods. This model serves as an extension of well-established theories drawn from existing literature, thus offering an advanced approach towards managing producer mobility. The model provides the dynamic mobility management solution to adapt to efficiently manage producer movements, ensuring optimal routing and efficient network performance. Comparative evaluations demonstrate marked advancements over existing solutions, establishing the model as a scalable and robust solution for NDN environments that solves high handoff latency, excessive signalling and long packet delivery issues. This work not only addresses current challenges in producer mobility but also sets a new direction for future research and practical applications in NDN architecture.

Distributed Mobility Management Support for Low-Latency Data Delivery in Named Data Networking for UAVs

Named Data Networking (NDN) has emerged as a promising architecture to overcome the limitations of the conventional Internet Protocol (IP) architecture, particularly in terms of mobility, security, and data availability. However, despite the advantages it offers, producer mobility management remains a significant challenge for NDN, especially for moving vehicles and emerging technologies such as Unmanned Aerial Vehicles (UAVs), known for their high-speed and unpredictable movements, which makes it difficult for NDN to maintain seamless communication. To solve this mobility problem, we propose a Distributed Mobility Management Scheme (DMMS) to support UAV mobility and ensure low-latency content delivery in NDN architecture. DMMS utilizes decentralized Anchors to forward proactively the consumer’s Interest packets toward the producer’s predicted location when handoff occurs. Moreover, it introduces a new forwarding approach that combines the standard and location-based forwarding strategy to improve forwarding efficiency under producer mobility without changing the network structure. Using a realistic scenario, DMMS is evaluated and compared against two well-known solutions, namely MAP-ME and Kite, using the ndnSIM simulations. We demonstrate that DMMS achieves better results compared to Kite and MAP-ME solutions in terms of network cost and consumer quality-of-service metrics.

Routing approaches in named data network: a survey and emerging research challenges

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.

End-to-end active queue management with Named-Data Networking

The innovative information-based Named-Data Networking (NDN) architecture provides a good opportunity to rethink many of the design decisions that are taken for granted in the Internet today. For example, active queue management (AQM) tasks have been traditionally implemented in the routers to alleviate network congestion before their buffers fill up. However, AQM operations could be performed on an end-to-end basis by taking advantage of NDN features. In this paper, we provide an implementation of an AQM algorithm for the NDN architecture that we use to drive a classical AIMD-based congestion control protocol at the receivers. To accomplish this, we take advantage of the 64-bit Congestion Mark field present in the link layer of NDN packets to encode both rate and delay information about each transmission queue along a network path. In order to make the solution scalable, this information is delivered stochastically, guaranteeing that receivers get accurate and updated information about every pertinent queue. This information is enough to implement the well-known controlled delay (CoDel) AQM algorithm. Simulation results show that our client-located CoDel implementation is able to react to congestion when the bottleneck queuing delay surpasses the 5ms target set by the usual in-network CoDel implementation and, at the same time, get a fair and efficient share of the available transmission capacity.

An efficient scheme for in-orbit remote sensing image data retrieval

The conflict between real-time retrieval of remote sensing image data (RSID) and the limited satellite network transmission resources is becoming more and more prominent. To address it, this paper proposes a novel scheme for RSID retrieval from the remote sensing satellite network, which exploits the spatio-temporal characterization (STC) of sensing images to improve data retrieval efficiency. In particular, based on the spatio-temporal characterization, a data content naming scheme is introduced and an algorithm is accordingly proposed for RSID segmentation in satellite nodes. With the naming scheme, RSID retrieval can be implemented by making use of the Named Data Networking (NDN) architecture. The study aims to investigate the effectiveness of making use of the STC of RSID for the retrieval under the NDN architecture. To the best of our knowledge, this paper is the first to exploit STC to establish connections between user demands, RSID, and data naming for NDN. As a result, the proposed scheme makes the network aware of RSID’s STC and consequently improves the data retrieval performance of the satellite network using NDN. The evaluation results show that the proposed scheme delivers about 65% and 7% higher retrieval hit rates than a retrieval scheme based on the original NDN proposal and a recently proposed scheme — CAP, respectively. In addition, comparing with these two schemes, the proposed one reduces transmission latency by about 20% and 15%, and traffic load by about 48% and 40%, all respectively. These imply that the proposed scheme outperforms in terms of higher data retrieval efficiency and better link utilization.

Interoperabilitas NDN-DPDK dan Forwarding NFD dalam Video Streaming berbasis NDN pada Virtual Machine

The Named Data Network (NDN) is a future network concept that addresses some of the issues present in the current internet architecture. One of the main advantages of NDN is the use of content caching at each router, enabling faster and more efficient data access. As internet network technology develops, the demand for video content continues to increase every year. Therefore, video optimization and delivery require high access speeds so that clients can run content from the server seamlessly. This research incorporates NDN-DPDK (Named Data Network-DData Plane Development Kit), which is designed as hardware acceleration, and uses NDN's default forwarder, Network Forwarding Daemon (NFD), which allows a wide variety of experiments with NDN architecture. The implementation and analysis of video streaming performance will use Quality of Service (QoS) parameters such as RTT, throughput, and startup delay to measure the quality of video streaming on the network side. In addition, CPU measurements are made on the router closest to the client to evaluate the traffic load required by the forwarder to transmit data. The results of implementation and analysis in this study obtained video streaming quality on the second accessor with an RTT time of 4 seconds, throughput above 0.4 MBps, a video startup delay of 8 seconds, and 100% CPU usage.

Leveraging Software-Defined Networking for a QoS-Aware Mobility Architecture for Named Data Networking

The internet’s future architecture, known as Named Data Networking (NDN), is a creative way to offer content-based services. NDN is more appropriate for content distribution because of its special characteristics, such as naming conventions for packets and methods for in-network caching. Mobility is one of the main study areas for this innovative internet architecture. The software-defined networking (SDN) method, which is employed to provide mobility management in NDN, is one of the feasible strategies. Decoupling the network control plane from the data plane creates an improved programmable platform and makes it possible for outside applications to specify how a network behaves. The SDN is a straightforward and scalable network due to its key characteristics, including programmability, flexibility, and decentralized control. To address the problem of consumer mobility, we proposed an efficient SDPCACM (software-defined proactive caching architecture for consumer mobility) in NDN that extends the SDN model to allow mobility control for the NDN architecture (NDNA), through which the MC (mobile consumer) receives the data proactively after handover while the MC is moving. When an MC is watching a real-time video in a state of mobility and changing their position from one attachment point to another, the controllers in the SDN preserve the network layout and topology as well as link metrics to transfer updated routes with the occurrence of the handoff or handover scenario, and through the proactive caching mechanism, the previous access router proactively sends the desired packets to the new connected routers. Furthermore, the intra-domain and inter-domain handover processing situations in the SDPCACM for NDNA are described here in detail. Moreover, we conduct a simulation of the proposed SDPCACM for NDN that offers an illustrative methodology and parameter configuration for virtual machines (VMs), OpenFlow switches, and an ODL controller. The simulation result demonstrates that the proposed scheme has significant improvements in terms of CPU usage, reduced delay time, jitter, throughput, and packet loss ratio.

The Emerging of Named Data Networking: Architecture, Application, and Technology

Named Data Networking (NDN) is developed to accommodate future internet traffic. In recent years, NDN’s popularity has grown due to the evolution of the Internet of Things, Artificial Intelligence, Cloud Services, and Blockchain. As part of Future Internet Architecture, the NDN architecture enables dynamic content management, mobility, privacy, and trustworthiness. However, there has yet to be a survey manuscript exploring NDN in the context of these contemporary technologies and applications. Hence this manuscript comprehensively highlights these motivations and the promises. Overall, Blockchain and 5G technology have dominated the trend with 73% of research interest, while transportation applications dominate 64% of the research interest. These significant insights show the emergence of the NDN and the potential to help the revolution of future internet traffic.

Interest Flooding Attacks in Named Data Networking: Survey of Existing Solutions, Open Issues, Requirements, and Future Directions

Named Data Networking (NDN) is a prominent realization of the vision of Information-Centric Networking. The NDN architecture adopts name-based routing and location-independent data retrieval. Among other important features, NDN integrates security mechanisms and focuses on protecting the content rather than the communications channels. Along with a new architecture come new threats, and NDN is no exception. NDN is a potential target for new network attacks such as Interest Flooding Attacks (IFAs). Attackers take advantage of IFA to launch (D)DoS attacks in NDN. Many IFA detection and mitigation solutions have been proposed in the literature. However, there is no comprehensive review study of these solutions that has been proposed so far. Therefore, in this article, we propose a survey of the various IFAs with a detailed comparative study of all the relevant proposed solutions as counter-measures against IFAs. We also review the requirements for a complete and efficient IFA solution and pinpoint the various issues encountered by IFA detection and mitigation mechanisms through a series of attack scenarios. Finally, in this survey, we offer an analysis of the open issues and future research directions regarding IFAs.

Hybrid 802.11p‐cellular architecture for NDN‐based VANET

SummaryVehicular network communications (VANET) face multiple challenges due to their intermittent connections and the rapid changes in their topologies. In recent years, several research efforts have explored the use of content‐centric approaches to alleviate some of these challenges. One of these promising network designs is Named Data Networking (NDN), which has become a valid solution to support VANET applications. However, in the NDN architecture, the main forwarding mechanism for the interest packets is flooding. This forwarding mechanism will result in excessive collisions, which will lead to the broadcast storm problem. In this paper, we propose VC‐NDN: a hybrid and hierarchical Named Data Networking architecture for VANETs. VC‐NDN improves content retrieval efficiency through an adapted NDN‐based communication model. VC‐NDN includes a new interest forwarding scheme to reduce packet collision in the network and an efficient mechanism to support push‐based traffic. Furthermore, to reduce communication costs, VC‐NDN uses two communication technologies in parallel, namely, IEEE 802.11p and cellular communications, while keeping the usage of the cellular network at a minimum level. Finally, to reduce the impact on vehicle mobility, VC‐NDN follows a hierarchical clustering architecture. Specifically, a density‐based clustering algorithm is designed to create and maintain stable clusters with multihop communication capability. Our performance study shows that VC‐NDN outperforms the basic VNDN solutions in terms of data retrieval delay and packet delivery ratio while minimizing the usage of the cellular network.

A bargain game theory assisted interest packet forwarding strategy for information centric network

In Information Centric Network (ICN), when implemented using NDN (Named Data Network) architecture, a client generates an ‘interest’ packet to retrieve a content. The interest packet carries the name of the searched content and may pull the data from any intermediate router that holds the requested content. An efficient interest packet forwarding mechanism is highly desirable in ICN to make the content retrieval faster. This paper describes an interest forwarding technique aiming at minimizing content retrieval time and network overhead. The process of interest forwarding is modelled as bargain game with data seeker as seller and content provider as buyer. Intermediate Content Routers (CRs) between the consumer and the actual producer is classified as either capable or incapable CRs represented as cCR and iCR respectively. Initially all CRs holds certain currency value based on their attributes. The cCRs are capable of serving interests and they are rewarded with a pre agreed trading price. The iCRs on the other hand are not capable of serving any content and hence they are rewarded by a fraction of the trading price based on the assistance provided in forming the data transmission path. To evaluate the strength of the new scheme the proposed bargain game theory (BGT) based technique is integrated with three existing protocols, namely, the Cache Less for More (CL4M), Characteristic Time Routing (CTR), and Probability based caching (pCache). The performance of new variations of these protocols are compared with their base versions. The simulation is performed in ns-3 based ndnSim-2.0. Performance parameters observed in the simulation are, content search latency, server hit ratio, network load, overhead and throughput. Simulation observation reveals that the integration of the proposed scheme significantly improves the performance in terms of aforementioned parameters.

An Efficient Location-Based Forwarding Strategy for Named Data Networking and LEO Satellite Communications

Low Earth orbit (LEO) satellite constellations are increasingly gaining attention as future global Internet providers. At the same time, named data networking (NDN) is a new data-centric architecture that has been recently proposed to replace the classic TCP/IP architecture since it is particularly well suited to the most common usage of the Internet nowadays as a content delivery network. Certainly, the use of NDN is especially convenient in highly dynamic network environments, such as those of next LEO constellations incorporating inter-satellite links (ISL). Among other native facilities, such as inbuilt security, NDN readily supports the mobility of clients, thus helping to overcome one of the main problems raised in LEO satellite networks. Moreover, thanks to a stateful forwarding plane with support for multicast transmission and inbuilt data caches, NDN is also able to provide a more efficient usage of the installed transmission capacity. In this paper, we propose a new location-based forwarding strategy for LEO satellite networks that takes advantage of the knowledge of the relative position of the satellites and the grid structure formed by the ISLs to perform the forwarding of NDN packets. So, forwarding at each node is done using only local information (node and destination locations), without the need of interchanging information between nodes, as is the case with conventional routing protocols. Using simulation, we show that the proposed forwarding strategy is a good candidate to promote the efficient and effective future use of the NDN architecture in LEO satellite networks.

Adaptive LRFU replacement policy for named data network in industrial IoT

In this paper, an adaptive least recently frequently used (LRFU) replacement policy is proposed for named data network (NDN) in the industrial internet of things (IIoT) environment. Low-latency network communication has become the main focus in IIoT development. By applying NDN architecture with the proposed replacement policy, the system can minimize the network latency of IIoT due to the NDN router’s capabilities to cache content. The simulation result shows that the proposed adaptive LRFU outperforms other popular replacement policies based on various network performances metrics. In addition, future research trends regarding the testbed implementation NDN replacement policy are suggested.

Cache management for large data transfers and multipath forwarding strategies in Named Data Networking

Named Data Networking (NDN) is a promising approach to provide fast in-network access to compact muon solenoid (CMS) datasets. It proposes a content-centric rather than a host-centric approach to data retrieval. Data packets with unique and immutable names are retrieved from a content store (CS) using Interest packets. The current NDN architecture relies on forwarding strategies that are only dependent upon on-path caching. Such a design does not take advantage of the cached content available on the adjacent off-path routers in the network, thus reducing data transfer efficiency. In this work, we propose a software-defined, storage-aware routing mechanism that leverages NDN router cache-states, software defined networking (SDN) and multipath forwarding strategies to improve the efficiency of very large data transfers. First, we propose a novel distributed multipath (D-MP) forwarding strategy and enhancements to the NDN Interest forwarding pipeline. In addition, we develop a centralized SDN-enabled control for the multipath forwarding strategy (S-MP), which leverages the global knowledge of NDN network states that distributes Interests efficiently. We perform extensive evaluations of our proposed methods on an at-scale wide area network (WAN) testbed spanning six geographically separated sites. Our proposed solutions easily outperform the existing NDN forwarding strategies. The D-MP strategy results in performance gains ranging between 10.4x to 12.5x over the default NDN implementation without in-network caching, and 12.2x to 18.4x with in-network caching enabled. For S-MP strategy, we demonstrate a performance improvement of 10.6x to 12.6x, and 12.9x to 18.5x, with in-network caching disabled and enabled, respectively. Further, we also present a comprehensive analysis of NDN cache management for large data transfers and propose a novel prefetching mechanism to improve data transfer performance. Due to the inherent capacity limitations of the NDN router caches, we use SDN to provide an intelligent and efficient solution for data distribution and routing across multiple NDN router caches. We demonstrate how software-defined control can be used to partition and distribute large CMS files based on NDN router cache-state knowledge. Further, SDN control will also configure the router forwarding strategy to retrieve CMS data from the network. Our proposed solution demonstrates that the CMS datasets can be retrieved 28%–38% faster from the NDN routers’ caches than existing NDN approaches. Lastly, we develop a prefetching mechanism to improve the transfer performance of files that are not available in the router’s cache.

Information-centric Edge Computing: A Survey

Edge Computing (EC) and Named Data Networking (NDN) are two emerging technologies that are considered as the most representative technologies for the future Internet. NDN directly forwards an application layer name in the network layer, mitigating the requirements of an individual and complex network addressing schemes for devices. The intermediate nodes and/or routers in NDN architecture cache the content inside their memory according to the caching policy to fulfill similar requests in the future within a short time. EC, on the other hand, offers computation, software services, data, and storage that are close to end-users compared to cloud computing, which results in lower delay and high speed of task execution. In the 5G communication scenarios and beyond, ultra-low latency, efficient mobility management, and security are fundamental requirements. Thus, the synergy of NDN with EC appears as a promising candidate and has attracted extensive attention from academia in the recent past. Therefore, in this survey paper, we discuss various techniques that integrate EC with Information Centric Networking (ICN)/NDN and fulfill the aforementioned requirements. We also shed light on the limitations and open research challenges in the field of NDN and EC for the research community.

A survey on the roles of Bloom Filter in implementation of the Named Data Networking

Today is the era of smart devices. Through smart devices, people remain connected with each other across the globe. But, it led the current Internet towards scalability issues. Therefore, leaving IP-based Internet behind, the world is moving to the Future Internet Architecture, called Named Data Networking (NDN). Currently, the number of nodes connected to the Internet is in the billions. Coupled with, the number of requests sent is in millions per second. NDN handles such huge numbers by modifying the existing IP architecture to meet the current requirements. NDN is scalable, generates less traffic, saves bandwidth, efficiently utilizes multiple network interfaces, provides high-level security, etc., which are essential for current communication technology. Correspondingly, Bloom Filter is a simple data structure capable of enhancing the performance of NDN. It is a probabilistic data structure for the membership query. Bloom Filter is deployed in various modules of NDN to handle the enormous number of packets. This article presents a detailed discussion on the role of Bloom Filter in implementing NDN. Moreover, the article includes a detailed discussion about Bloom Filter and the NDN architecture’s main components: Packet, Content Store, Forwarding Information Base, and Pending Interest Table. The article also provides many tables to increase the understanding of the topics.

Hybrid communication architecture in VANETs via named data network

SummaryThe limitations of the transmission control protocol/Internet protocol (TCP/IP) model have given birth to a new futuristic trend called named data networking (NDN), focusing on retrieving the desired data by using content names instead of host addresses. In this context, we proposed another NDN architecture named hybrid communication in vehicular ad hoc networks (VANETs) via named data network (HCIV‐NDN) to reduce packet loss, eliminate the unnecessary message exchange, and to assume that in one cluster not all receivers nodes rebroadcast. Also, it investigates the NDN concept to vehicle to road side unit (V2R), vehicle‐to‐vehicle (V2V), and road side unit to infrastructure (R2I) plus vehicle‐to‐infrastructure (V2I) communications to enlarge the connectivity of vehicles. The vehicles are clustered and can communicate with the base station, with road side unit (RSU), and among them to define a new data dissemination protocol. Hence, the HCIV‐NDN mechanism applies two types of timers to select some farthest nodes as forwarder to rebroadcast packets at different times. Thus, we study the performance of our HCIV‐NDN with node density effects for smart cities and then we compare it with the existing location‐based deferred broadcast (LBDB) scheme. Simulation results exhibited that HCIV‐NDN scheme achieves more than 90% in terms of the cache‐hit ratio when the percent of consumers interested in the same data is about 50%. Then it performs better than LBDB in terms of satisfaction ratio, packet loss ratio, and the average delay in a suburban scenario.

Detection of malicious consumer interest packet with dynamic threshold values.

As a promising next-generation network architecture, named data networking (NDN) supports name-based routing and in-network caching to retrieve content in an efficient, fast, and reliable manner. Most of the studies on NDN have proposed innovative and efficient caching mechanisms and retrieval of content via efficient routing. However, very few studies have targeted addressing the vulnerabilities in NDN architecture, which a malicious node can exploit to perform a content poisoning attack (CPA). This potentially results in polluting the in-network caches, the routing of content, and consequently isolates the legitimate content in the network. In the past, several efforts have been made to propose the mitigation strategies for the content poisoning attack, but to the best of our knowledge, no specific work has been done to address an emerging attack-surface in NDN, which we call an interest flooding attack. Handling this attack-surface can potentially make content poisoning attack mitigation schemes more effective, secure, and robust. Hence, in this article, we propose the addition of a security mechanism in the CPA mitigation scheme that is, Name-Key Based Forwarding and Multipath Forwarding Based Inband Probe, in which we block the malicious face of compromised consumers by monitoring the Cache-Miss Ratio values and the Queue Capacity at the Edge Routers. The malicious face is blocked when the cache-miss ratio hits the threshold value, which is adjusted dynamically through monitoring the cache-miss ratio and queue capacity values. The experimental results show that we are successful in mitigating the vulnerability of the CPA mitigation scheme by detecting and blocking the flooding interface, at the cost of very little verification overhead at the NDN Routers.

Fair hop-by-hop interest rate control to mitigate congestion in named data networks

Data retrieval in Named Data Networking (NDN) is based on content names irrespective of their hosting location. The NDN architecture introduces original naming, forwarding and caching techniques to improve data delivery efficiency. These distinctive techniques make the TCP congestion control scheme not suitable for the NDN architecture. In particular, the in-network caching and the multi-path forwarding used in the NDN architecture lead to fluctuations in the Round Trip Time (RTT) measurements. This makes the Retransmission TimeOut (RTO) an unreliable congestion indicator. Thus, the congestion problem in Named Data Networks deserves to be reconsidered. In this paper, we present a new congestion control algorithm, called IRNA (Interest Rate Notification and Adjustment), to mitigate the congestion problem in Named Data Networks while maintaining per flow and per consumer fairness property. More specifically, IRNA is a hop-by-hop scheme where each router monitors the occupation level of its outgoing queues to detect in advance potential congestion events. When the queue size is above or below a preset threshold, the router sends explicit notifications to its downstream nodes to specify the appropriate interest rate. Hence, by cooperatively adjusting the Interest transmission rate of each node and for each flow, IRNA succeeded to provide a fair transmission. We evaluated the performance of our solution using ndnSIM simulations. We compared IRNA to state-of-the-art hop-by-hop congestion control solution and we proved that IRNA managed to provide a faster congestion reaction and to achieve per flow and per consumer throughput fairness while maintaining a good bandwidth usage.

An Accelerating Approach for Blockchain Information Transmission Based on NDN

Blockchain is becoming more and more popular in various fields. Since the information transmission mode of the blockchain is data broadcasting, the traditional TCP/IP network cannot support the blockchain system well, but the Named-Data Networking (NDN) could be a good choice because of its multi-path forwarding and intra-network caching functions. In this article, we propose a new blockchain information transmission acceleration strategy (AITS) combining with graph theory and probability theory based on the NDN architecture. We select some more important nodes in the network as “secondary nodes”, and give them more bandwidth and cache space to assist the NDN network in data transmission. In order to select the correct node as the secondary node, we present a method to calculate the number of secondary nodes, and give the function to calculate the importance of each node. The simulation results show that in complex networks, the proposed method has superior performance in accelerating information transmission and reducing data overhead.