Data aggregation in named data networking

As a key component in implementing Named Data Networking (NDN), Pending Interest Table (PIT) requires an efficient exact-matching algorithm for a scalable and fast PIT lookup. A Bloom filter (BF) is a memory-efficient data structure for performing exact matching operations. In this paper, three different BF-based PIT architectures are proposed: PIT using functional Bloom filters (FBF-PIT), PIT using counting Bloom filters with return values (rCBF-PIT), and a refined rCBF-PIT with signatures (R-rCBF-PIT). The proposed BF-based PITs incrementally allocate a new BF for storing multiple incoming faces of Interest packets with the same content name. For a Data packet lookup, the proposed PIT architectures simultaneously access every BF structure to find matching faces and delete the faces (i.e., matching Interest packet information). The functional Bloom filter (FBF) used in an FBF-PIT is a key-value data structure that stores values only without keys. However, because the number of non-reusable conflict cells in the FBF increases as the number of stored packets increases in the FBF-PIT, the indeterminable rate increases. To decrease the indeterminable rate, we propose the rCBF-PIT, which uses counting Bloom filters with return values (rCBFs), allowing reusable conflict cells. False positives for Interest packets lead to incorrect deletions that can cause false negatives for incoming Data packets. Because most of the false positives occur in the first BF structure, we finally propose the R-rCBF-PIT, in which the first rCBF is replaced with an rCBF with a signature field. The proposed PITs also provide an aging mechanism using a valid bit and a hit bit for entry expiration. Simulation results show that rCBF-PIT and R-rCBF-PIT both reduce the indeterminable rate by more than 81% compared with FBF-PIT. The results also show that R-rCBF-PIT resolves false negatives caused by incorrect deletions by including the signature fields in the first rCBF.

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.

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) proposes a contentcentric 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 dependent upon on-path caching and is therefore inefficient. This approach reduces data transfer efficiency by ignoring the cached content available on the adjacent off-path routers in the network. In this paper, we propose a novel distributed multipath (D-MP) forwarding strategy and enhancements to the NDN Interest forwarding pipeline. Furthermore, we develop a centralized SDNenabled control for the multipath forwarding strategy (S-MP) that distributes Interests efficiently by using the global knowledge of the NDN network states. We perform extensive evaluations of our proposed methods on an at-scale WAN testbed spanning six geographically separated sites. Our solutions outperform the existing NDN forwarding strategies by a significant margin. We show that 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 gains of 12.2x to 18.4x with in-network caching. In addition, for the S-MP case, we demonstrate a performance improvement of 10.6x to 12.6x, and 12.9x to 18.5x, for with- and without in-network caching respectively.

The vision of the Internet of Things (IoT) is that it connects all kinds of things by leveraging the creation of increasingly affordable and small devices that can be embedded for sensing, processing, wireless communication, and actuation. Named data networking (NDN) is a newly emerging Internet paradigm that may replace the current Internet architecture and that fulfills most of the expectations of the IoT. Software-defined networking (SDN) is an emerging paradigm of technology that is highly capable of managing overall networks efficiently and transforming complex network architectures into manageable, simple ones. The combination of the SDN controller, NDN, and IoT can be lethal in the overall performance of the network. Broadcast storms, due to the flooding nature of NDN’s wireless channel, are a serious issue when it comes to forwarding interest and data packets. Energy consumption of sensor nodes in dense IoT scenarios causes problems in forwarding as well as unnecessary delays, decreases network performance, and increases the cost and packet delay for important packets. We took these problems as our baseline and proposed an energy-efficient, priority-based forwarding (EPF) in SDN-enabled NDN–IoT. Our scheme EPF used the efficient flow management of the SDN controller to control the broadcast storm and efficiently forward the priority-based packets. A defer timer mechanism was used to prioritized the packet upon its arrival to the node. An energy threshold mechanism was used to control energy consumption and improve overall energy efficiency. We compared our scheme with the traditional flooding mechanism and geographic interest forwarding; EPF outclassed the other schemes and produced the best results in terms of total number of interests and retransmissions, content retrieval time, total number of priority interests, energy consumption, and network lifetime.

Blockchain can be used to ensure trust in a decentralized environment in which no trusted authority is available. Its original idea is to collect transactions in a block, and to chain the blocks together in such a way that attackers cannot forge the chain if the majority of the network is honest. Since its creation in 2008, blockchain technology has been used broadly in Internet to support decentralized payments, cloud computing, publishing, etc. This work focuses on public permissionless blockchain which neither guards against bad actors nor enforces access control. Named data networking (NDN) uses name-based routing and in-networking caching to support efficient content delivery, making it a promising future Internet architecture as well as a great network technology which can improve blockchain data delivery. Therefore, it is a very necessary task to enable deployment of blockchain applications over NDN. However, NDN is not immediately compatible with typical blockchain, since (permissionless) blockchain applications usually require broadcasting transactions and blocks in real time, which is not supported by the “pull” design of NDN. In this work, we propose BoNDN which enables blockchain applications over NDN. Unlike previous work, BoNDN follows the core design of NDN. We treat each type of blockchain data needed to be broadcast individually. Specifically, we rely on Interest broadcasting to support real-time broadcasting of blockchain transactions, which is small in size and can be brought by an Interest packet. In addition, we propose a subscription-push approach to support broadcasting of blockchain blocks, in which each miner performs subscription, and once a block is generated, the subscribed miner will receive the block.

Internet of Things (IoT) is changing our life for the better. IoT covers various heterogeneous devices which are sensing the environment and/or monitoring a special event in the network. These devices are mostly mobile and are wirelessly connected either to each other or to the Internet. Additionally, IoT devices run many different applications and services which provide the consumers with data and information. This paper focuses on the design and implementation of an Application Programming Interface (API) for IoT services using the Named Data Networking (NDN). NDN provides an efficient and intelligent communication paradigm for constrained devices like in IoT and uses named content to transmit data in the network. We extend the IoT-NDN architecture and add a new layer for IoT services which will effectively improve the performance of communication between the heterogeneous devices and the services integrated in IoT-NDN. Furthermore, we show the usage of our API and give a small example of network time synchronisation on IoT devices. This illustrates how flexible and lightweight is our approach for several services implemented on heterogeneous devices in IoT.

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.

An autonomous and efficient controller-based routing scheme for networking Named-Data mobility

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.

A Lightweight Forwarding Strategy for Named Data Networking in Low-end IoT

In recent years, the Internet of Things (IoT) has become a standard facet of modern communications, and information-centric networks have been pointed as an alternative to bypass the restrictions imposed by the traditional Internet protocol networks regarding the mobility of its network elements. However, the improvements imposed by this new paradigm fall short in large scale mobile wireless distributed environments inherent to IoT, due to high node mobility, dynamic topologies and intermittent connectivity. To tackle these issues, we present a named data network (NDN)-based publish–subscribe mechanism with support for both Consumer and Producer mobility. This approach handles the Producer mobility by combining the Data packets with infrastructure specific information, fixing the broken paths between the Producer and the Consumer; and the Consumer mobility by monitoring and anticipating mobile node trajectories while compelling the infrastructure to adjust to new paths. Simulation results, assuming a smart city use case and using real traces of vehicular mobility, have shown that the proposed solution far surpasses the native NDN workflow and traditional publish–subscribe solutions. With respect to the Producer mobility, the proposed solution delivers 79% of Data packets against 14% with the Native implementation, when using 25 mobile Producers; regarding the Consumer mobility, results have shown that our solution achieves almost the same Consumer satisfaction ratio as previous implementations but reducing substantially the network overhead related with the transmission of Interest packets.

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.

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.

A Contextual Multi-Armed Bandit approach for NDN forwarding