Push-Based Traffic-Aware Cache Management in Named Data Networking

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.

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.

Named data networking (NDN) is a new Internet architecture that replaces today’s focus on where – addresses and hosts with what – the content that users and applications care about. One of NDN’s prominent advantages is scalable and efficient content distribution due to its native support of caching and multicast in the network. However, at the last hop to wireless users, often the WiFi link, current NDN implementation still treats the communication as multiple unicast sessions, which will cause duplicate packets and waste of bandwidth when multiple users request for the same popular content. WiFi’s built-in broadcast mechanism can alleviate this problem, but it suffers from packet loss since there is no MAC-layer acknowledgement as in unicast. In this paper, we develop a new NDN-based cross-layer approach called NLB for efficient and scalable live video streaming over wireless LAN. The core ideas are: using WiFi’s broadcast channel to deliver content from the access point to the users, a leader-based mechanism to suppress duplicate requests from users, and receiver-driven rate control and loss recovery. The design is implemented and evaluated in a physical testbed comprised of one software AP and 20 Raspberry Pi-based WiFi clients. While NDN with multiple unicast sessions or plain broadcast can support no more than ten concurrent viewers of a 1Mbps streaming video, NDN plus NLB supports all 20 viewers, and Received December 29, 2015; accepted April 28, 2016 E-mail: zhxp@tsinghua.edu.cn can likely support much more when present.

Detecting interest flooding attacks in NDN: A probability-based event-driven approach

Named data networking (NDN) is a new and promising Internet architecture, which aims to replace the current transmission control protocol/Internet protocol (TCP/IP)-based Internet. The NDN internet architecture has introduced several benefits in numerous applications. An NDN-based indoor positioning and navigation system can further optimize existing localization technologies with reduced the server load and faster response time. In this study, an NDN-based approach for the existing Wi-Fi fingerprinting-based indoor positioning and navigation was investigated. Among the many features of NDN, the network-level caching can reduce the computational load and response time of the localization and navigation server. The theoretical analysis of the runtime complexity shows that the NDN's network-level caching performance is better than those of the conventional algorithms. In this paper, naming methods for different services and a server-side algorithm for handling the NDN requests are proposed. The real-world implantation and testing results show a better overall performance than that of TCP/IP. This network-level optimization for indoor positioning and navigation opens new opportunities because it can be combined with other application-level optimization techniques for more efficient indoor positioning and navigation in the future.

Space-Ground Integrated Networks (SGINs) hold the potential to enable seamless and high-quality global coverage in an economically viable manner. However, the limited bandwidth and relatively long delay of satellite-ground links pose significant challenges in meeting the increasing demands driven by surging traffic. To address this issue, we propose a three-tier cooperative caching architecture incorporating base stations (BSs), satellites, and a content server, which aims to reduce the average content retrieval delay through cooperative caching between BSs and satellites. The joint optimization problem among them is both challenging to solve and non-scalable due to its exponentially increasing computational complexity. Meanwhile, the geographic characteristics of requests are overlooked in existing work. As a consequence, we propose a novel block partitioning algorithm based on the popularity similarity across areas to facilitate cooperative caching, which reduces the computational complexity, and ensures the scalability and the effectiveness of cooperative caching. Based on the partitioned blocks, the optimization problem is decomposed into two subproblems: intra-block cooperative optimization among BSs and inter-block cooperative optimization among satellites, effectively catering to the characteristics of wide-area coverage in SGINs. For the subproblems with finite dimensions, Semidefinite Relaxation (SDR) based intra-block and inter-block cooperative caching approaches are proposed to obtain the optimal cooperative caching strategies. Extensive simulations demonstrate that, compared to directly solving the original problem, the proposed algorithm reduces the solving time from exponential to linear growth. Moreover, our algorithm outperforms existing schemes by reducing 13% average retrieval delay and improving 12% overall cache hit rate.

This article describes how the named data networking (NDN) has recently received a lot of attention as a potential information-centric networking (ICN) architecture for the future Internet. The NDN paradigm has a great potential to efficiently address and solve the current seminal IP-based IoT architecture issues and requirements. NDN can be used with different sets of caching algorithms and caching replacement policies. The authors investigate the most suitable combination of these two features to be implemented in an IoT environment. For this purpose, the authors first reviewed the current research and development progress in ICN, then they conduct a qualitative comparative study of the relevant ICN proposals and discuss the suitability of the NDN as a promising architecture for IoT. Finally, they evaluate the performance of NDN in an IoT environment with different caching algorithms and replacement policies. The obtained results show that the consumer-cache caching algorithm used with the Random Replacement (RR) policy significantly improve NDN content validity in an IoT environment.

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.

Named Data Networking (NDN), as one of the candidates for a future Internet, has the potential to overcome many of the current Internet's difficulties (e.g., security, mobility, multicasting, etc.). However, there are also many open problems to be taken care of before it becomes operational. One of the major concerns is that NDN may be memory intensive. Using the router's buffer as cache adds a search time to all requests. If the cache hit rate is not high enough (considering current buffer sizes and traffic rates), cache search time may be a burden on the system instead of solving any problems. Huge fast memories are not affordable yet. To balance the memory speed with incoming rate to a router, we propose a memory architecture, called ndn||mem, along with a content caching strategy, called CCndn. Using these two ideas, only a small fraction of packets need to engage in a time-intensive cache search process. Simulation results demonstrate the efficacy of our architecture

Mobile Internet access has become the norm rather than an exception in our daily lives, resulting in a large proportion of traffic attributed to mobile devices. To enhance the mobility support in Internet architecture, many research initiatives have devoted to investigating Named Data Networking (NDN) as the fundamental paradigm for the future Internet. NDN supports the consumer mobility by re-issuing the Interest packets if the consumer still wants the desired content after moving to the new point of attachment. To the best of the authors' knowledge, seldom study is made to investigate the performance of NDN under mobile consumers with varying moving speed and Interest generation rate. To this end, this paper establishes a simulation environment for NDN architecture capable of serving mobile consumers based on ndnSIM in NS3, and then investigates the performance of NDN in the presence of mobile consumers in terms of several key parameters. The experimental results show that the increase in moving speed results in more re-issued Interests and higher Interest-to-Data communication delay. In addition, the higher the Interest generation rate is, the worse the network performance becomes.

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.

This work proposes a scheme to promote autonomous and selfish NDN (Named Data Networking) peering domains to cooperate in caching, here dubbed Not So Cooperative Caching (NSCC). We consider a network comprised of selfish nodes; each is with a caching capability and an objective of reducing its own access cost by fetching data from local cache or from neighboring caches. The challenge is to determine what objects to cache at each node so as to induce low individual node access costs, and the realistic access “price” model which allows various access “prices” of different node pairs further complicates the decision making. NSCC attempts to identify mistreatment-free object placement to incur implicit cooperation even among these selfishly behaving domains, and to further identify Nash equilibrium object placement from mistreatment-free object placements so that no domain can unilaterally change its placement and benefit while the others keep theirs unchanged, and to improve the cooperation performance with respect to fairness So far, using a game-theoretic approach NSCC seeks a global object placement in which the individual node access costs are reduced as compared to that when they operate in isolation and achieves Nash equilibrium. Our preliminary experiments with IBR verified its effectiveness. And we discuss the specific issues of NSCC's implementation in NDN.

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.

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.

The proposed Internet paradigm The Flying Ad Hoc Network (FANET), Named Data Network (NDN), and Software Defined Network (SDN) have attracted the interest of the scientific community. The TCP/IP protocol is the present Internet standard, while NDN is the future internet architecture that builds on it. Data availability is improved via NDN, which substitutes named data for the nodes' addresses. SDN is a good option for communicating effectively, utilizing resources effectively, and supporting developing technologies. The SDN has attracted interest because of its high-level programmability and flexibility. Numerous applications in the military, business, and civil sectors make extensive use of FANE T. The broadcast characteristic of NDN causes an issue known as a broadcast storm in dense FANET environments. The issue is caused by duplicate packets, which raises the overall amount of traffic and retransmissions. FANET has a problem with the timely and quick transmission of essential packets. In this paper, we suggested a new scheme named "Novel Adaptive Broadcast Storm Avoidance (NABA)" for SDN and NDN-enabled FANET, which uses a controller to lessen the broadcast issue. Our scheme made use of the SDN controller's effective flow management to regulate the broadcast storm and facilitate packet transfers. Additionally, we divided up the packet into categories based on priority. The priority of the packet is determined by the naming criterion. In terms of the overall number of Interests and content retrieval time, the findings show that NAB A performs better than native NDN floods.