Interest Packets Research Articles

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.

A Secure and Cached-Enabled NDN Forwarding Plane Based on Programmable Switches

Recently, the rapid development of software-defined networking (SDN) and programming protocol-independent packet processors (P4) provides a potential possibility for the deployment of Named Data Networking (NDN), which has aroused tremendous attention in academia. Existing P4-based NDN solutions mainly focus on how to describe the stateful forwarding characteristics of NDN in a programmable switch environment. However, the existing solutions still face many challenges such as cache availability and data confidentiality and do not support retransmission of interest packets and multicast forwarding of data packets. In this paper, we propose a new NDN forwarding plane based on programmable switches to address the above challenges. We design a decoupled cache module to avoid a large impact on the data plane forwarding performance when the cache function is enabled. Also, we enhance the design of the existing P4-based NDN forwarding plane to support interest retransmission and multicast forwarding of data packets. In addition, with the advantage of network programmability of P4 technology, we extend the content permutation algorithm and integrate it into the NDN forwarding plane, which makes our scheme support lightweight secure forwarding. Finally, we evaluate our scheme in the prototype system and conduct comparative experiments with representative schemes. Experiment results show that our scheme outperforms it in terms of content retrieval latency and received throughput and can support lightweight secure forwarding with low cost.

Multi-classifier and meta-heuristic based cache pollution attacks and interest flooding attacks detection and mitigation model for named data networking

ABSTRACT This study’s main goal is to provide a novel assault detection model with two phases. The features such node, distribution, pattern, frequency, and run time are extracted in the first phase. The Deep Convolutional Neural Network (CNN) is then used to detect cache pollution attacks (also known as content poisoning attacks), which include interest flooding for existing data, interest flooding for non-existing data, hijacking incoming interest packets, and signing data with the incorrect key. Similar to the first phase, the second phase involves extracting the aforementioned attributes and feeding them into a fuzzy decision tree (FDT) in order to identify an interest flooding attack. For accurate attack detection, this paper aims to optimise both DCNN and FDT classifiers. This work provided a fresh Decision Oriented Rider Optimisation Algorithm (DO-ROA), an enhancement of the traditional ROA, to address the optimisation problem. With regard to specific Type I and Type II performance measures, the suggested DO-ROA algorithm’s performance is compared to that of other traditional models, demonstrating the superiority of the presented work.

Interest Broadcasting and Timing Attack in IoV (IBTA-IoV): A novel architecture using Named Software Defined Network

Advancement in Internet has led to the creation of a digital community in which everything is connected and is accessible remotely. However, such advancement comes with many problems as traditional networks have become more complex and harder to configure according to predefined policies. Named Software-Defined Network (NSDN) is an emerging paradigm in computer networks. It is gaining interest because it promises to control and manage networks more simply and efficiently than traditional networks. NSDN is considered the adoption of Named Data Network (NDN) and Software Defined Network (SDN). Named Data Network (NDN) is a great platform to overcome the traditional Internet addressing limitations. Instead of IP addresses, content names are used to communicate between various nodes in NDN. On other hand, the Internet of Vehicle (IoV) is an emerging new application of the Internet of Things (IoT) that is getting popularity because it promises to extend network connectivity to a large extent. IoV relies on the broadcast pattern to exchange useful information with a specific range of vehicles. However, this exchange of information often leads to many problems in terms of security and duplication of packets. This article proposes an efficient scheme to address problems related to the routing (broadcast storm and isolated network) of Named Software-Defined Internet of Vehicle (NSDIoV). Moreover, a Timing Attack problem is also addressed in this article. This article proposes a novel scheme named Interest Broadcasting and Timing Attack in IoV (IBTA-IoV). The first part of the proposed scheme addresses the Timing Attack issue while the second part of the proposed scheme tackles the Interest packets broadcasting and isolated network problem. IBTA-IoV is compared with native Vehicular Named Data Network (VNDN), IBFS, and IBFS with the attacker. The evaluation results show that the proposed solution in this article is simple, efficient, and provides high performance in terms of variable traffic scenarios.

A trust-aware cluster-based communication architecture for vehicular named data networking

Information-centric Networking (ICN) is a new networking paradigm that aims to solve the problem of the traditional TCP/IP-based Internet. Content-centric Networking (CCN) and Named Data Networking (NDN), both based on the Interest/Data communication paradigm, are two of the most well-known and specialized implementations of ICN. In contrast to typical networks, NDN enables intrinsic security, which ensures data security rather than communication channel security. Each response/data packet in transit has a signature on the contents of the data to ensure security. As a result, an invalid signature indicates an unauthenticated data packet. This ongoing hierarchical authentication verification approach causes a significant delay while providing the appropriate security levels. As a result, in a highly mobile environment with delay-sensitive applications like Vehicular Ad hoc Networks (VANETs), such a technique is neither viable nor scalable. We present a unique Trust-Aware Cluster-based Communication Architecture (TACCA) for Vehicular Named Data Networking in this study, which aims to improve the security of NDN-driven VANETs (VNDN). It separates the route segments into clusters and chooses cluster heads based on their trustworthiness and proximity to the center location. The selected cluster heads are then in charge of disseminating interest packets to prevent the broadcast storm problem. Once the data producer has been located, the data is returned to the requester in the quickest and most secure manner possible. Simultaneously, the intermediate vehicles decided whether or not to verify the data's validity based on their subjective perceptions of the data's producer's conduct. As a result, the calculation complexity and time are reduced. Our idea is able to maintain vanilla NDN security standards while lowering the produced end-to-end latency by more than three times, according to simulation data. As a result, the proposed TACCA is more suited to mobile networks(...)

A survey on interest packet flooding attacks and its countermeasures in named data networking

A survey on interest packet flooding attacks and its countermeasures in named data networking

PMSS: Producer Mobility Support Scheme Optimization with RWP Mobility Model in Named Data Networking

Abstract: The movement pattern of mobile producer plays an important role in mobility performance analysis of the wireless and mobile network. However, the producer mobility behavior is directly affecting the handoff latency and signaling overhead cost. Many researchers provide analytical investigation to analyze and solve the handoff problems and compared with the simulation result. To justify between simulation and analytical investigation, movement behavior of mobile node needs to be included in the analytical investigation to make it possible to compare with the simulation-based result. This paper incorporated Random WayPoint Mobility (RWPM) model, to determine the behavior of mobile producer, for analytical solution of producer mobility support in NDN. In this paper, we introduce mobility Interest packets to conveyed new prefix or location of mobile producer, a broadcasting strategy to facilitate the handoff process and the immobile anchor router was modified to perform a dual function that is, tagging of anchors and broadcasting of tagged mobility Interest packets. The performance analysis for mobile producer behavior and handoff latency shows that our proposed Producer Mobility Support Scheme (PMSS) reduces handoff latency compared to DNS-like and Home Agent routing approach.

Reliable data delivery in ICN-IoT environments

In an IoT environment, which is characterized by a multitude of interconnected smart devices with sensing and computational capabilities, many applications are (i) content-based, that is, they are only interested in finding a given type of content rather than the location of data, and (ii) contextualized, that is, the content is generated and consumed in the proximity of the user. In this context, the Information-Centric Networking (ICN) paradigm is an appealing model for efficiently retrieving application data, and the service decentralization towards the network edge helps to reduce the core network load being the data produced by IoT devices mainly confined in the area where they are generated. MobCCN is an ICN-based data delivery protocol that we designed for operating efficiently in such context (Borgia et al., 2016, 2018), where static and mobile IoT devices are enriched with ICN functions. Specifically, MobCCN leverages an efficient routing and forwarding protocol, exploiting opportunistic contacts among IoT mobile devices, to fill the Forwarding Interest Base (FIB) tables so as to correctly forward Interest packets towards the intended data producers. In this paper, we aim to enhance the reliability of MobCCN by exploring different retransmissions mechanisms, such as retransmissions based on number of duplicate Interests that are received for the same requested content, periodic retransmissions, single path versus disjoint multi-path forwarding, hysteresis mechanism and combinations of them. Extensive simulation results show that, among the analysed MobCCN variants, the one that implements both periodic retransmissions and a hysteresis-based retransmission process ensures the highest delivery rates (up to 95%) and the shortest network path, with a very limited traffic overhead due to retransmissions.

An interest‐based access control scheme via edge verification in Named Data Networking

SummaryNamed Data Networking (NDN) is a disruptive future architecture, in which content delivery can be significantly improved through named routing and distributed caching. However, distributed caching also leads to serious access control problems. Once a content is disseminated to the network, any entity can fetch it regardless of owning the access permission or not. To protect the authorized content, current solutions are mainly designed based on data packet encryption, but redundant in‐network traffic is still a challenge due to illegal interest‐data exchange. Focus on this problem, an Interest‐Based Access Control scheme via Edge Verification (IBAC‐EV) is proposed in this paper. In IBAC‐EV, the producer authorizes the user to sign interest packet. By checking the signature, the edge router can forbid unsubscribed users to enter network through discarding interest packets. Simulation results show that IBAC‐EV can effectively reduce the in‐network traffic. Moreover, by using proxy signature algorithm, it simplifies the complexity of key management and alleviates the storage overhead on the edge router.

An Efficient Distributed Content Store-Based Caching Policy for Information-Centric Networking.

Content store (CS) is one of the main components of information-centric networking (ICN), which enables content objects to be cached and retrieved from any intermediate node in the network. However, in existing ICN designs, CS information is not exploited to coordinate content caching and content retrieval. CS of nodes in the network operates independently while Interest packets forwarding mainly uses forwarding information base (FIB). This paper highlights the importance of CS information for efficient content caching and content retrieval to improve the performance of information-centric networking, especially in resource-constrained environments like the Internet of Things. We propose an efficient caching policy to coordinate the CS of a node with its neighbor nodes in a distributed manner so that more and more popular content objects are cached in the neighborhood of the node. To exploit and coordinate CS information among nodes, we urge to enable CS information in the data plane of the network and design an efficient way for CS information transmission. Each node contributes to the objective of its neighborhood by maximizing its number of unique popular content objects being cached in its CS and not cached in the CS of its neighbors. We implement the proposed policy on top of state-of-the-art popularity-based caching schemes. Through analysis and experiments, we show that the proposed caching policy achieves a significant improvement in terms of cache hit ratio, stretch ratio, content retrieval latency, and energy efficiency significantly compared to state-of-the-art schemes.

A fair dynamic content store-based congestion control strategy for named data networking

In this paper, the congestion control for named data networking (NDN) is studied. A novel dynamic content store-based congestion control strategy is proposed on account of the characteristic of in-network cache in NDN. A queuing network model is constructed to judge whether congestion occurs. If the network has the tendency of congestion or the congestion happened, the buffer of the output queue is dynamically expanded by borrowing NDN content store (CS), and the forwarding rates of data packets and corresponding interest packets are reduced so as to prevent or alleviate network congestion. In order to reflect fairness, the CS to be borrowed by the data output queue in the port is calculated in terms of the data output queue length and its weight. The simulation results based on ndnSIM show that the given scheme improves the bottleneck link utilization and maintains a low packet loss rate and average flow completion time.

An approach for FIB construction and Interest packet forwarding in information centric network

Routing protocol in Information Centric Network (ICN) prepares Forward Information Base (FIB) and routing table to assist the process of content retrieval. The content seeker generates Interest packets for the desired content and the routing module forwards it to the right store. One of the challenging tasks in ICN is to design an efficient FIB construction mechanism to improve the performance by adequately forwarding Interest packets to the right store of data. The focus of this manuscript is to address the said challenge of FIB construction and Interest forwarding. First, we propose a scheme for FIB construction from the information communicated through content advertisement. Then, an Interest packet forwarding scheme is presented for faster retrieval of the searched content. The FIB construction is governed by Bloom Filter (BF) enabled content advertisement and the Interest forwarding is guided by information gradient. The proposed scheme is simulated in ndnSim −2.0 and results are compared with both contemporary BF and non-BF based approaches. Parameters such as FIB convergence rate, control overhead, FIB and routing table size, false positive rate, content retrieval delay and Interest success rate are perceived. The experiment shows that the proposed scheme performs better than other approaches. Quantitatively, compared to other protocols, the proposed scheme performs better around 10%–25% in convergence rate, more than 50% in network load, and around 30%–45% in content retrieval delay.

An Efficient Probe-Based Routing for Content-Centric Networking.

With the development of new technologies and applications, such as the Internet of Things, smart cities, 5G, and edge computing, traditional Internet Protocol-based (IP-based) networks have been exposed as having many problems. Information-Centric Networking (ICN), Named Data Networking (NDN), and Content-Centric Networking (CCN) are therefore proposed as an alternative for future networks. However, unlike IP-based networks, CCN routing is non-deterministic and difficult to optimize due to frequent in-network caching replacement. This paper presents a novel probe-based routing algorithm that explores real-time in-network caching to ensure the routing table storing the optimal paths to the nearest content provider is up to date. Effective probe-selections, Pending Interest Table (PIT) probe, and Forwarding Information Base (FIB) probe are discussed and analyzed by simulation with different performance measurements. Compared with the basic CCN, in terms of qualitative analysis, the additional computational overhead of our approach is O(NCS + Nrt + NFIB ∗ NSPT) and O(NFIB) on processing interest packets and data packets, respectively. However, in terms of quantitative analysis, our approach reduces the number of timeout interests by 6% and the average response time by 0.6 s. Furthermore, although basic CCN and our approach belong to the same Quality of Service (QoS) category, our approach outperforms basic CCN in terms of real values. Additionally, our probe-based approach performs better than RECIF+PIF and EEGPR. Owing to speedup FIB updating by probes, our approach provides more reliable interest packet routing when accounting for router failures. In summary, the results demonstrate that compared to basic CCN, our probe-based routing approach raises FIB accuracy and reduces network congestion and response time, resulting in efficient routing.

SVM-based Analysis for Predicting Success Rate of Interest Packets in Information Centric Networks

ABSTRACT A consumer in Information Centric Network (ICN) generates an Interest packet by specifying the name of the required content. As the network emphasizes on content retrieval without much bothering about who serves it (a cache location or actual producer), every Content Router (CR) either provides the requested content back to the requester (if exists in its cache) or forwards the Interest packet to the nearest CR. While forwarding an Interest packet, the ICN routing by default does not provide any mechanism to predict the probable location of the content searched. However, having a predictive model before forwarding may significantly improve content retrieval performance. In this paper, a machine learning (ML) algorithm, particularly a Support Vector Machine (SVM) is used to forecast the success of the Interest packet. A CR can then send an Interest packet in the outgoing interface which is forecasted successful. The objective is to maximize the success rate which in turn minimizes content search time and maximizes throughput. The dataset used in is generated from a simulation topology designed in ndnSim comprising 10 K data points having 10 features. The linear, RBF and the polynomial kernel (with degree 3) are used to analyze the dataset. The polynomial kernel shows the best behavior with 98% accuracy. A comparative retrieval time with and without ML demonstrates around 10% improvement with SVM enable forwarding compared to normal ICN forwarding.

Dynamically Allocated Bloom Filter-Based PIT Architectures

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.

A Hop by Hop Congestion Control Algorithm Based on Interest Packet Shaping in Named Data Networking

A Hop by Hop Congestion Control Algorithm Based on Interest Packet Shaping in Named Data Networking

Producer mobility support in information-centric networks: research background and open issues

In recent times, an interesting innovation of information-centric networking (ICN) architecture has been introduced to replace the old fashion host-centric communication architecture with content-centric architecture. With the instant growth of mobile devices and mobile data traffic, the mobility issue in the current IP-based network is growing rapidly and is facing many inefficiencies such as unsupported mobility and data delivery. The unsupported mobility causes failure of the communication system and inaccessibility in the network services. The unsupported mobility stimulates several complications and issues in the network such as unavailability of content, denial of service, interest packets loss, and excessive burden in the network. Further, unsupported mobility affects the routing and forwarding plane in the network and terminates the content transmission to its consumers. Thus, this paper will critically explore this issue. It will present a strong foundation of the producer mobility support architecture, research challenges, previous solutions, and open research issues. Along with this discussion, a research roadmap will be delineated.

Provides an Approach based on Adaptive Forwarding and Label Switching to Improve the Speed of Packet Forwarding in NDN Networks

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.

An Efficient Content Store-Based Forwarding Scheme for Internet of Things.

One of the main advantages of information-centric networking (ICN) is that a requested piece of content can be retrieved from a content store (CS) at any intermediate node, instead of its original content producer. In existing ICN designs, nodes forward Interest packets mainly based on forwarding information base (FIB). FIB is constructed from name prefixes registered by content producers with a list of next hops to the name prefixes. The ICN forwarding engine uses those information to forward Interest packets towards corresponding content producers. CS information of a node is currently used only for checking the availability of cached content objects at the node and is not considered in the data plane of existing ICN forwarding mechanisms. This paper highlights the importance of CS information in an ICN forwarding mechanism and enables neighbor CS information in the data plane to improve the cache hit ratio and forwarding efficiency, especially for resource-constraint Internet of Things (IoT). We propose an efficient CS-based forwarding scheme for IoT. The proposed forwarding scheme exploits CS information of neighbors to find efficient routes to forward Interest packets toward nearby nodes with corresponding cached content. For that, we carefully design an efficient way for CS information sharing using counting bloom filter. We implement the proposed scheme and compare with state-of-the-art ICN forwarding schemes in IoT. Experimental results indicate that the proposed forwarding scheme achieves a significant improvement in terms of cache hit ratio, energy efficiency, content retrieval latency, and response rate.

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.