Pending Interest Table Sizing in Named Data Networking

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) is a new network architecture derived from the success of the Internet. Specifically, NDN addresses and identifies data by naming. Source and destination host addresses are not required for data communication in the NDN because the data is uniquely named instead. In the NDN network, the Forwarding Information Base (FIB) table is responsible for data forwarding, the Pending Interest Table (PIT) is liable for holding the state of data forwarding process, and the Content Store (CS) is used to stock data chunks within the network to optimize the forwarding time to the data without contacting to the content producer. All these data structures consume the memory of devices existing in the Named Data Networking of Things (NDNoT). Accordingly, the size of the FIB, PIT and CS needs to be carefully adjusted in NDNoT environments for performance tuning and Quality of Service (QoS) provisioning. In this study, we explore the issues of FIB sizing on average and maximum occupancy, reliability and maximum delay for constant bit rate (CBR) traffic where each content producer is addressed with a prefix name in the Cooja simulator environment. The results indicate that FIB table size has an impact on the reliability and maximum delay. During the number of records in FIB outpaces the count of nodes in the network, the reliability decreases gradually. Therefore, in constrained NDNoT environment careful allocation of the memory among FIB, PIT and CS becomes an important issue. According to our knowledge so far, this work is the first study showing the effect of FIB table on the performance in an NDNoT environment.

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

Radient: Scalable, memory efficient name lookup algorithm for named data networking

Using Interests (requests that elicit content) and maintaining per-Interest forwarding state in Pending Interest Tables (PIT) are integral to the design of the Named Data Networking (NDN) and Content-Centric Networking (CCNx) architectures. However, using PITs makes the network vulnerable to Interest-flooding attacks, and PITs can become very large. It is shown that in-network caching eliminates the need for Interest aggregation and obviates the use of PITs. A new approach to content-centric networking (CCN-GRAM) is introduced that provides all the benefits of NDN and CCNx, eliminates the use of PITs by means of anonymous datagrams, and is immune to Interest-flooding attacks. Routers maintain routes to the anonymous origins of Interests using an on-demand routing approach in the data plane that can also be used to provide native support for multicasting in the dat a plane. Simulation experiments show that the number of forwarding entries required in CCN-GRAM is orders of magnitude smaller than the number of PIT entries.

The large expansion in network services and applications seen in the last few years requires new network architectures to satisfy an increasing number of users and enhance content delivery. Named Data Networking (NDN) has recently appeared as a new paradigm to solve many shortcomings in the current TCP/IP architecture. Its main characteristics like stateful forwarding and in-network caching made NDN networks an efficient environment for data delivery where the data is retrieved based on content names rather than IP addresses. The NDN, by its nature, defends against the well-known Distributed Denial of Service (DDoS) attacks that take place in the traditional TCP/IP architecture. However, a special kind of DoS attack called Collusive Interest Flooding Attack (CIFA) has appeared to overwhelm the resources of NDN routers by filling their Pending Interest Tables (PIT) with long-lasting malicious entries. The network throughput and consumer satisfaction rate are highly affected by CIFA. A lightweight yet efficient stateless CIFA detection algorithm is proposed in this research utilizing the non-parametric CUSUM algorithm; a change point detection approach that detects the point in time when a transition occurs in the network. The proposed algorithm is characterized by its low computational overhead, highly accurate detection, and quick response. To detect the malicious name prefixes and eliminate the CIFA effect, a mitigation algorithm that uses the average response time vales of all name prefixes is proposed in this research. Experimental results show that this approach detects CIFA after 199.5 ms from when an attack is launched in the large-scale topology. In addition, the mitigation approach effectively reduces the PIT utilization and increases the average consumer satisfaction rate.

To viably identify interest flooding assault (IFA) in Named Data Networking (NDN), this paper proposes a discovery technique for interest flooding assault dependent on chi-square test and similitude test. Initially, it decides the identification window size dependent on the dissemination of data name prefixes (that is data entropy) in the current organization traffic. The assailants might annex subjective irregular suffix to a certain prefix in the organization traffic, and afterward send an enormous number of interest parcels that can't get the reaction. Focused on at this issue, the affectability of chi-square test is utilized to distinguish the difference in pre-fix of interest parcels. Premium parcels started by IFA assailants are generally joined to a genuine prefix, yet with an arbitrarily created suffix appended. Considering of this issue, the similitude of interest parcel prefixes is additionally identified. At long last, the location consequences of the two viewpoints are consolidated to hinder mine if interest flooding assault has happened. Moreover, as indicated by the symmetric steering normal for Pending Interest Table (PIT), likewise the fashioned interest parcel will be sent back to the aggressor, and afterward confine the corresponding port of the assailant, to viably smother the IFA assault. The test results show that the proposed technique cannot just identify IFA in NDN toward the start of the assault, yet in addition is more precise and powerful than different strategies.

Named Data Networking (NDN) is considered as a prominent architecture towards future Wireless Local Area Networks (WLAN), and multicast plays an important role in data delivery such as media streaming, multipoint videoconferencing, etc. However, to achieve high-efficiency multicast in NDN WLAN is challenging for two significant reasons. First, without feedback mechanism in IEEE 802.11 standards, to guarantee reliability, the current multicast scheme transmits the multicast data with the basic rate (e.g., 1 Mbps for IEEE 802.11b), which inevitably increases the transmission delay for high-speed consumers. Second, as a NDN multicast group is constituted by consumers who are requesting the same content, multicast groups are easy to form and evolve rapidly, where a data rate adaptation scheme is requisite to accommodate differential multicast groups. In this paper, we propose a multi-stage multicast rate adaptation scheme for NDN WLAN, named <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">NDN-MMRA</i> , to minimize the total transmission time with reliability guarantee for multicast group members. In <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">NDN-MMRA</i> , by checking the Pending Interest Table (PIT) status information, the number of consumers in each multicast group as well as their receiving capabilities are known ahead; with the available data rates in a specific 802.11 standard, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">NDN-MMRA</i> determines: 1) how many transmission stages are required; and 2) in each stage, which data rate should be adopted. The merit is that with multi-stage transmissions, the data rate can be adapted in descending order to accommodate high-speed consumers with delay minimized, and low-speed consumers with reliability guaranteed. We implement <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">NDN-MMRA</i> in NS-3 by adopting the ndnSIM module, and conduct extensive experiments to demonstrate its efficacy under different IEEE 802.11 standards and various underlying WLAN topologies.

Content-Centric Routing is the cornerstone of the standardization efforts related to Named Data Networking (NDN). It enables advanced communication paradigms and facilitates content replication and caching, by allowing routers to exchange information and perform forwarding based on content item identifiers rather than location identifiers (e.g., network addresses). However, since content may originate from multiple locations, malicious nodes can advertise content that they do not host, effectively hijacking the corresponding content name prefixes. In this paper, we leverage two recent W3C recommendations, Decentralized Identifiers (DIDs) and Verifiable Credentials (VCs), to enable routing nodes to independently check whether a content advertisement was generated by an authorized node, in a fully decentralized manner that does not rely on trusted third parties. We implement and evaluate our solution in a system where advertisements are verified by the content routers at the edge of the network, showing that it prevents fake routing advertisements with minimal overhead.

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.

Vehicular ad hoc networks have highly dynamic topologies, making data exchange among mobile nodes challenging. Named data networking (NDN) has been applied to vehicular networks recently, and the results are promising, as NDN supports highly dynamic topologies better than traditional IP architectures. However, as of yet, vehicular named data networks (VNDNs) have no support for pushing critical data into the network, and the existing consumer pull mechanism introduces undesirable delay. Therefore, we propose a proactive data dissemination scheme for pushing critical content to one-hop neighbours in VNDN. Producers of critical content first send a beacon message containing metadata about tentative new chunks. Upon receiving the beacon message, neighbors make temporary pending interest table entries, allowing them to subsequently store new chunks once received. We evaluate the proposed scheme using ndnSIM and find it more efficient than pure consumer pull VNDN.

As a result of its usefulness in a variety of contexts, Named Data Networking (NDN) has been a popular topic of study in the last several decades. The Pending Interest Table (PIT) is a crucial part of the NDN that keeps track of all the data included in interest packets. Even if there is no flexible replacement policy, controlling PIT remains a significant problem because of the widespread use of long-term interest. The proposed PIT control system combines the Adaptive Virtual PIT (AVPIT) system, the Smart Threshold Interest Lifetime (STIL) system, as well as the Highest Lifetime Least Request (HLLR) principle. Based on the Interest Satisfaction Ratio (ISR) and the available PIT table capacity, our work chooses the best forwarder to send the packet of interest. Our work uses this method to successfully handle PIT controls via NDN.

Live migration is a key technique for virtual machine (VM) management in data center networks, which enables flexibility in resource optimization, fault tolerance, and load balancing. Despite its usefulness, the live migration still introduces performance degradations during the migration process. Thus, there has been continuous efforts in reducing the migration time in order to minimize the impact. From the network's perspective, the migration time is determined by the amount of data to be migrated and the available bandwidth used for such transfer. In this paper, we examine the problem of how to schedule the migrations and how to allocate network resources for migration when multiple VMs need to be migrated at the same time. We consider the problem in the Software-defined Network (SDN) context since it provides flexible control on routing. More specifically, we propose a method that computes the optimal migration sequence and network bandwidth used for each migration. We formulate this problem as a mixed integer programming, which is NP-hard. To make it computationally feasible for large scale data centers, we propose an approximation scheme via linear approximation plus fully polynomial time approximation, and obtain its theoretical performance bound. Through extensive simulations, we demonstrate that our fully polynomial time approximation (FPTA) algorithm has a good performance compared with the optimal solution and two state-of-the-art algorithms. That is, our proposed FPTA algorithm approaches to the optimal solution with less than 10% variation and much less computation time. Meanwhile, it reduces the total migration time and the service downtime by up to 40% and 20% compared with the state-of-the-art algorithms, respectively.

This paper analyses design and performance aspects of a brushless doubly fed three-phase induction machine with wound rotor circuit accessed by rotary transformer. It focuses firstly on the advantages of substituting brushes and slip-rings by rotary transformers. Secondly it shows the device operation conditions and rotary transformer calculation by using Finite Element Software in 2D domain. In sequence are presented analytical dynamic and steady state models for prediction of machine behavior. The analytical dynamic model is obtained by transforming the equations written in machine variables into equations written in arbitrary reference frame. The steady state model considers electrical circuit techniques to obtain information about current, power factor and efficiency on load. Design data of a 90kW prototype were considered for numerical results presented on this study.