Name Filter: A Countermeasure Against Information Leakage Attacks in Named Data Networking

The named data networking flow filter: Towards improved security over information leakage attacks

Data centers (DCs), owing to the exponential growth of Internet services, have emerged as an irreplaceable and crucial infrastructure to power this ever-growing trend. A DC typically houses a large number of computing and storage nodes, interconnected by a specially designed network, namely, DC network (DCN). The DCN serves as a communication backbone and plays a pivotal role in optimizing DC operations. However, compared to the traditional network, the unique requirements in the DCN, for example, large scale, vast application diversity, high power density, and high reliability, pose significant challenges to its infrastructure and operations. We have observed from the premium publication venues (e.g., journals and system conferences) that increasing research efforts are being devoted to optimize the design and operations of the DCN. In this paper, we aim to present a systematic taxonomy and survey of recent research efforts on the DCN. Specifically, we propose to classify these research efforts into two areas: 1) DCN infrastructure and 2) DCN operations. For the former aspect, we review and compare the list of transmission technologies and network topologies used or proposed in the DCN infrastructure. For the latter aspect, we summarize the existing traffic control techniques in the DCN operations, and survey optimization methods to achieve diverse operational objectives, including high network utilization, fair bandwidth sharing, low service latency, low energy consumption, high resiliency, and etc., for efficient DC operations. We finally conclude this survey by envisioning a few open research opportunities in DCN infrastructure and operations.

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.

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 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 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.

Named data networking is a new communication paradigm for the future networking architecture, which shifts the networking from a host-oriented architecture to an information-centric one. Its data transmission is realized via name-based routing and forwarding. This, however, brings severe challenges to the scalability of the forwarding information base (FIB) because the name space is infinite and can be several orders of magnitude larger than the IP counterpart. This letter tries to mitigate the FIB explosion problem and achieve high-speed forwarding by adding route cache to the FIB design. We proposed two approaches to tackle the cache hiding problem rooted from the longest prefix matching on names of arbitrary length: the atomic caching that groups multiple overlapping prefixes as a unit for cache operation, and the on-the-fly caching that caches only the most specific prefixes. Trace-driven simulation using an HTTP request trace from China Mobile demonstrated the feasibility and effectiveness of our design.

As an important infrastructure of the current Internet, the Domain Name System (DNS) universally supports most of Internet applications. The DNS is established on top of Internet Protocol (IP) to provide an addressing of Internet resources. However, the IP based current Internet communication model is considered as inappropriate for supporting an explosive increase of Internet devices and contents in the Future Internet. To address the communication model issue, Named Data Networking (NDN) has been proposed that allows a consumer only cares about what he wants but not where the content is. Although NDN designs an ideal communication model for the content-intensive Future Internet, it assumes a clean-slate deployment, which would take a long time for deployment. The coexistence of the NDN paradigm and the current Internet is thus expected. In this vein, we propose a new scheme that utilizes current DNS protocols for content naming and addressing in a NDN environment. The proposed scheme helps to accelerate the NDN evolution while providing a means of utilizing the DNS for scalable and secure NDN.

Named data networking (NDN) as a promising future network architecture has been widely considered as a very appropriate network protocol for multihop wireless network (MWN). In named-data MWN, congestion control, forwarding strategy, and power control are three coupled critical issues. There are already extensive works about cross-layer design for MWN with IP and they have demonstrated the advantage of cross-layer design. Enlightened by cross-layer designs for MWN with IP, in this paper, the joint congestion control, forwarding strategy, and power control problem for named-data MWN are studied, and it is modeled as a named-data network utility maximization (NDNUM) problem. In our NDNUM, we maximize data receiving rate related network utility minus power consumption, while consider NDN’s communication characteristics that are different from IP. Then a distributed iterative algorithm based on subgradient method is proposed in order to solve NDNUM. To the best of our knowledge, our algorithm is the first cross-layer design for congestion control and power control for named-data MWN. We show that network utility maximization not only can be used to facilitate cross-layer design for networks with end-to-end protocols but also can be used to design cross-layer mechanisms for information-centric network. From simulation, our algorithm outperforms existing congestion control mechanism in network throughput, resource utilization efficiency, and stabilization PIT size.

Software Defined Networking (SDN) is the more reliable and flexible networking architecture. Due to its programmable nature, it is getting more popular in every research domain of Computing. Moreover, Named Data Networking (NDN) architecture is also more beneficial and emerging technology of Internet. NDN focuses on the content name instead of its location and replaces the usage of IP addresses. Lot of research has been made to integrate SDN and NDN due to their benefits of better management-ability, flexibility, less complexity, centralized control, decoupled control and data planes etc. Mobile Ad Hoc Network (MANET) is also getting more popular due to huge advancement in Mobile communication devices. Combining SDN and NDN in MANET will resolve lots of problems (i.e. forwarding, mobility, management etc.) which are difficult to tackle with single architecture. Broadcast Storm is always a challenging issue in Ad Hoc networks like MANET. In this paper, we proposed a Controller based Selective Forwarding (CSF) scheme by merging SDN, NDN and MANET to overcome the Broadcast Storm Problem (BSP) and other issues caused by BSP. CSF is evaluated using different simulation parameters which shows superiority over the Native ND-MANET in reference to BSP.

Information-Centric Networking (ICN) is a new communication paradigm that replaces the host addresses by the name of content; Named Data Networking (NDN) is a promising ICN architecture that has attracted research attention in recent years. NDN is a receiver-driven architecture implements pull-based communication in the form of one-interest-one-data. This model poses different challenges, especially from the transport layer perspective. In contact to IP-based networks where the congestion is handled in an end-to-end manner, NDN cannot apply the same concept, while most of the existing solutions are based on hop-by-hop connection. In this paper, we present a new congestion control mechanism for NDN based on link quality estimation. We focus our efforts to provide fast data transmission, decrease packet dropping rate, and maximize the link utilization. The simulation results show that our solution outperforms the NDN schemes in terms of throughput and drop packets.

Boosting named data networking for data dissemination in urban VANET scenarios

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%.

World wide web (WWW) is a huge collection of unorganized documents. To build the database from this unorganized network, web crawlers are often used. The crawler which interacts with millions of web pages needs to be efficient in order to make a search engine powerful. This utmost requirement necessitates the parallelization of web crawlers. In this work, a fuzzy-based technique for uniform resource locater (URL) assignment in dynamic web crawler is proposed that utilizes the task splitting property of the processor. In order to optimize the performance of the crawler, the proposed scheme addresses two important aspects, (i) creation of crawling framework with load balancing among parallel crawlers, and (ii) making of crawling process faster by using parallel crawlers with efficient network access. Several experiments are conducted to monitor the performance of the proposed scheme. The results prove the effectiveness of the proposed scheme.

So far, the University KH A. Wahab Hasbullah cooperative service system. to customers is done manually even small things such as customer questions to cooperatives regarding the availability and price of an item must be done manually and of course it is very disturbing ease of shopping and tends to waste time for customers. Telegram messenger is a social messenger or chat media that has a lot of unique features that are free so it is very beneficial to use for the general public, one of its unique features is its telegram-bot (Telegram BOT). Telegram BOT Api is a robot created with a program that can perform many instructions given by the creator or user, this bot itself is just a telegram account running on software that has artificial intelligence features. This telegram api bot offers developers to make it easier to retrieve data and process it into useful information. Telegram bot itself is divided into two, namely the mobile version (telegram bot) and the web version. The result of this research is that this mobile application is managed using a webhook as the communication method. This method is used because it is very easy and bots do not have to update data regularly because one of them is placed in the Uniform Resource Locator (URL). And if there is an incoming message, it will be directly displayed at the specified URL and will then be forwarded to the bot for processing. This telegram api bot offers developers to make it easier to retrieve data and process it into useful information. Telegram bot itself is divided into two, namely the mobile version (telegram bot) and the web version. The result of this research is that this mobile application is managed using a webhook as the communication method. This method is used because it is very easy and bots do not have to update data regularly because one of them is placed in the Uniform Resource Locator (URL). And if there is an incoming message, it will be directly displayed at the specified URL and will then be forwarded to the bot for processing. This telegram api bot offers developers to make it easier to retrieve data and process it into useful information. Telegram bot itself is divided into two, namely the mobile version (telegram bot) and the web version. The result of this research is that this mobile application is managed using a webhook as the communication method. This method is used because it is very easy and bots do not have to update data regularly because one of them is placed in the Uniform Resource Locator (URL). And if there is an incoming message, it will be directly displayed at the specified URL and will then be forwarded to the bot for processing. The result of this research is that this mobile application is managed using a webhook as the communication method. This method is used because it is very easy and bots do not have to update data regularly because one of them is placed in the Uniform Resource Locator (URL). And if there is an incoming message, it will be directly displayed at the specified URL and will then be forwarded to the bot for processing. The result of this research is that this mobile application is managed using a webhook as the communication method. This method is used because it is very easy and bots do not have to update data regularly because one of them is placed in the Uniform Resource Locator (URL). And if there is an incoming message, it will be directly displayed at the specified URL and will then be forwarded to the bot for processing.