Information-Centric Networking Research Articles

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.

Application Areas of Information-Centric Networking: State-of-the-Art and Challenges

The Information-Centric Network (ICN) paradigm has gained popularity since its inception. The host-based IP networks were not primarily designed to handle scenarios that it is exposed to on the current Internet. In that direction lot of research has been happening to develop applications such as web applications, multimedia streaming, the Internet of Things, Wireless Sensor Networks and Vehicular networks. In addition, new ICN application areas, such as social networks, Industrial IoTs, etc., are emerging. This review investigates the possible application areas and their deficiencies evenly, broadly and at a certain level of depth with focus on security, scalability, IP interoperability, modularity and other application specific aspects. We discuss the current state-of-the-art in these ICN-based applications and the existing limitations. A comparative analysis of the literary works available is performed to understand the research gaps available, and a detailed discussion of the challenges in each area is provided.We conclude the review with future challenges in the application development with the ICN paradigm to reap its architectural benefits.

Producer Mobility Support in Information-Centric Networks: Research Background and Open Issues

Producer Mobility Support in Information-Centric Networks: Research Background and Open Issues

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.

Migrating From IP to NDN Using Dual-Channel Translation Gateway

The emergence of communication networks has resulted in a system of content-based networks. Therefore, a novel network design called Information-Centric Networking (ICN) promotes the efficient transfer of content objects, whereas Named-Data Networking (NDN) is one of the most promising candidates. While migration from Internet Protocol (IP) to NDN is inevitable, it is prohibitively expensive to replace all routers instantaneously with NDN routers during the transition period. Hence, we propose the dual-channel IP-to-NDN translation gateway to address this problem. The gateway promotes the semantics of the IP protocol to be equal to those of NDN at the network layer by utilizing two unique IP addresses as channels so that it can distinguish an IP packet as either an interest or a data packet. In addition, the proposed gateway uses a name binding mechanism to transmit packets between IP and NDN hosts seamlessly by conducting non-data-payload reading to preserve the privacy of users. Finally, the throughput performance of the dual-channel gateway is examined for two distinct binding strategies, namely static and dynamic prefix-name binding. We analyze the throughput by comparing a throughput-estimation model with an emulation testbed. Especially, we emphasize the relationship between the hit ratio, processing delay, and throughput. According to numerical evaluation, we show that the throughput-estimation model successfully predicts the throughput with an accuracy of about 90% and 85% in static and dynamic prefix-name binding schemes, respectively. Moreover, the results show that an increase in content popularity skewness, α, from 0.7 to 1.5 improved the throughput of the proposed gateway by about 70% when the cache size was 1% of the prefix name count in the static prefix-name binding. Alternatively, the throughput increased ten times when the content popularity skewness increased from 0.7 to 1.5 in the dynamic prefix-name binding.

Reassessing caching performance in information-centric IoT

The performance of in-network caches has traditionally been evaluated using well-understood metrics such as the cache hit rate. This extends to the field of Information-Centric Networking (ICN), where caching strategies are evaluated in the same way. In this paper, we argue that in the subdomain of information-centric Internet of Things (IoT), these traditional metrics are not sufficient to describe caching performance. Using a series of experiments on real hardware as a demonstration, we show the shortcomings of the cache hit rate metric and introduce the two new metrics cache access factor and cache latency factor that provide deeper insights into the effectiveness of in-network caching strategies.

Consumer Mobility Awareness in Named Data Networks

Mobile data traffic has increased significantly due to the evolution of wireless communication technologies. The Information Centric Network paradigm is considered as an alternative to bypass the restrictions imposed by the traditional IP networks, especially those related with the mobility of its users. Despite the potential advantages of this paradigm regarding mobile wireless environments, several research challenges remain unaddressed, more specifically the ones related with the communication damage caused by handovers. This work presents a Named Data Network (NDN) based solution that supports Consumer mobility. The proposed scheme addresses a mobility manager entity that monitors and anticipates trajectories, while compelling the infrastructure to adjust to the new paths. This process results in an efficient way to manage the Consumers’ mobility, and therefore, in a better quality of service to its users. The implementation and evaluation of the proposed solution uses the ndnSIM, through functional and non-functional scenarios, and with real traces of urban vehicular mobility and connectivity. The results show that the proposed solution is superior to the native NDN workflow with respect to content delivery ratio and number of timeouts.

Digital Evidence Management System for Cybercrime Investigation using Proxy Re-Encryption and Blockchain

One of the most beneficial uses of the Internet of Things in cloud is data sharing. As tempting since this technology is, data security is still one of the issues it faces, as inappropriate data usage may lead to a range of issues. We offer a proxy re-encryption strategy to securely exchange data in cloud contexts in this paper. Data owners can utilize identity-based encryption to send encrypted data to the cloud, and legitimate users can access the data via proxy re-encryption. Because IoT devices have limited resources, an edge device functions as a proxy server to do complex calculations. We also make effective use of information-centric networking capabilities to supply cached data in the proxy, resulting in better service quality and more network capacity. Our system also uses block chain, a revolutionary technology that allows for decentralized data sharing. It improves centralized system efficiency and enables fine-grained data access control. The security analysis and assessment of our system show that it has the potential to offer privacy protection, authenticity, and dependability.

A PRODUCTIVE IBPRE MODEL FOR SECURE DATA SHARING IN BLOCKCHAIN TECHNOLOGY BASED IOT

Intelligent tailored services are necessary to fulfill the expectations of users. In order to provide a highly dependable service, additional information about the user's surroundings is required. In order to capture a vast quantity of data, the Internet of Things (IoT), which links multiple gadgets over the Internet, has been created. Although cloud computing is frequently utilized to effectively manage data, it has the potential to delay the transmission of data as well. In this work, we suggest a proxy re-encryption strategy to secure data sharing in cloud contexts. Data owners may outsource their encrypted data to the cloud using identity-based encryption, while proxy re-encryption construction will enable genuine user’s access to the data. An edge device serves as a proxy server for computationally expensive tasks since IoT devices have limited resources. Using information-centric networking capabilities, we may effectively serve cached material in the proxy, hence enhancing service quality and efficiently using network traffic. We've also built our system on block chain, a revolutionary new technology that makes it possible to centralize the sharing of data. It reduces the load on centralized systems and allows for more precise management of data access. The security study and assessment of our scheme reveal the potential of our technique in protecting data confidentiality, integrity, and security

A mobility-compliant publish–subscribe system for an information-centric Internet of Things

The Information centric networking paradigm has proven particularly useful for the constrained Internet of Things (IoT), in which nodes are challenged by end-to-end communication without network assistance. This work focuses on the interaction between possibly mobile sensors and actuators in such IoT regimes which deploy the Named-Data Networking (NDN) architecture. Constrained nodes in interactive scenarios need to be highly responsive but can only manage limited control state. We argue that the request-driven NDN networking paradigm, which prevents pushing of unsolicited data, should be preserved to confine the attack surface, whereas unsolicited link-local signaling can accelerate responses without sacrificing security.In this paper, we contribute HoP-and-Pull (HoPP), a robust publish–subscribe scheme for typical IoT scenarios that targets low-power and lossy wireless networks running hundreds of resource constrained devices at intermittent connectivity. Our approach limits in-memory forwarding state to a minimum and naturally supports producer mobility, a temporary partitioning of networks, data aggregation on intermediary hops, and near real-time reactivity. We thoroughly evaluate the protocol by experiments in a realistic, large testbed with varying numbers of constrained devices, each interconnected via IEEE 802.15.4 wireless LoWPANs. We compare HoPP with common ICN pub–sub and mobility schemes as well as with basic MIPv6 and anchor-based multicast mobility. Implementations are built on CCN-lite with RIOT and support experiments using various single- and multi-hop scenarios.

An Adaptive Hierarchical Hybrid Multicast Based on Information-Centric Networking

Many information-centric services have emerged, such as IPTV and video conferencing. These services put a lot of demands on scalable multicast communication. However, traditional IP multicast has low adoption because of its poor scalability. Therefore, some stateless multicast methods were proposed, which encapsulate the destination’s information into the packet header without requiring routers to maintain the multicast forwarding state. However, stateless multicast also faces some problems, such as ingress router overload, high forwarding overhead, packet redundancy, etc. In addition, most multicast methods cannot optimize the multicast tree because the multicast flow is simply forwarded along the shortest path tree from the source to receivers. This paper proposes an Adaptive Hierarchical Hybrid Multicast (AHHM) based on Information-Centric Networking. To balance the forwarding states and forwarding overhead, AHHM is designed as a two-layer structure, in which the upper layer establishes a stateful main tree and the lower layer establishes several stateless sub trees. The router on the main tree is defined as the multicast join node (MJN), and AHHM uses the Name Resolution System to maintain the mapping between each multicast group name and corresponding MJNs. To optimize the multicast transmission path, we designed the minimum cost selection strategy for users to select the appropriate MJN to join. Simulation results show that compared with Source-Specific Multicast (SSM) and Bit Index Explicit Replication (BIER), AHHM can not only reduce the multicast forwarding states but also reduce the control overhead and link load.

Service Prioritization in Information Centric Networking With Heterogeneous Content Providers

Service prioritization brings reasonable allocation of network resources and improves the overall quality of experience (QoE) of users, but it has not been thoroughly investigated in information centric networking (ICN). Existing works lack adaptability and they cannot ensure specific content provider (CP) get well caching service which is one of the most important functions in ICN. In this paper, we firstly propose a service prioritization scheme to flexibly provide different caching services for heterogeneous CPs to improve the overall network efficiency. The main idea is to allocate dedicated cache space for paying CPs and provide prioritized caching service for them, while normal CPs only enjoy the normal caching service. The scheme can be divided into two phases. First, we select a group of nodes with higher importance as core nodes based on network topology, and pair each edge node to a core node following the two-sided many-to-one matching algorithm. Second, we dynamically allocate and manage the dedicated cache space for core nodes. We model the allocation of dedicated cache space and convert it into a convex optimization problem to solve. After that, a practical caching strategy and system design are implemented in the ndnSIM simulator. Finally, we evaluate our scheme and conduct comparative experiments with the most representative work diff-caching, simulation results show that our scheme outperform it in terms of both delay and cache hit ratio.

A Defense Mechanism Against Timing Attacks on User Privacy in ICN

While in-network caching is an essential feature of Information Centric Networks (ICN) for improved content dissemination and reducing the bandwidth consumption at the core of the network, it is prone to many privacy threats. For example, an adversary can passively breach the privacy of a consumer by simply analyzing the different retrieval times for the same content. This paper aims to address this problem of timing analysis attacks by developing privacy-enhancing caching strategies. The proposed caching strategies use two privacy metrics, namely mutual information from information theory and differential privacy, and formulates a privacy enhancing distributed optimization problem with the objective of optimizing the network cost incurred. We efficiently solve the optimization problem by considering it as a <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula> -player, non-cooperative game. We show that Nash equilibrium exists for this game and compute it using an iterative best response algorithm. We compare and validate the performance of our approach on realistic network topologies by comparing it with the existing approaches in literature and the global optimal solutions.

The Impact of Networking Protocols on Massive M2M Communication in the Industrial IoT

Common use cases in the Industrial Internet of Things (IIoT) deploy massive amounts of sensors and actuators that communicate with each other or to a remote cloud. While they form too large and too volatile networks to run on ultra-reliable, time-synchronized low-latency channels, participants still require reliability and latency guaranties. We elaborate this for safety-critical use cases. This paper focuses on the effects of networking protocols for industrial communication services. It analyzes and compares the traditional Message Queuing Telemetry Transport for Sensor Networks (MQTT-SN) with the Constrained Application Protocol (CoAP) as a current IETF recommendation, and also with emerging Information-centric Networking (ICN) approaches, which are ready for deployment. Our findings indicate a rather diverse picture with a large dependence on deployment: Publish-subscribe protocols are more versatile, whereas ICN protocols are more robust in multi-hop environments. MQTT-SN competitively claims resources on congested links, while CoAP politely coexists on the price of its performance.

Graph-Based Namespaces and Load Sharing for Efficient Information Dissemination

Graph-based namespaces are being increasingly used to represent the organization of complex and ever-growing information eco-systems and individual user roles. Timely and accurate information dissemination requires an architecture with appropriate naming frameworks, adaptable to changing roles, focused on content rather than network addresses. Today’s complex information organization structures make such dissemination very challenging. To address this, we propose POISE, a name-based publish/subscribe architecture for efficient topic-based and recipient-based content dissemination. POISE proposes an information layer, improving on state-of-the-art Information-Centric Networking solutions in two major ways: 1) support for complex graph-based namespaces, and 2) automatic name-based load-splitting. POISE supports in-network graph-based naming, leveraged in a dissemination protocol which exploits information layer rendezvous points (RPs) that perform name expansions. For improved robustness and scalability, POISE supports adaptive load-sharing via multiple RPs, each managing a dynamically chosen subset of the namespace graph. Excessive workload may cause one RP to turn into a “hot spot”, impeding performance and reliability. To eliminate such traffic concentration, we propose an automated load-splitting mechanism, consisting of an enhanced, namespace graph partitioning complemented by a seamless, loss-less core migration procedure. Due to the nature of our graph partitioning and its complex objectives, off-the-shelf graph partitioning, e.g., METIS, is inadequate. We propose a hybrid, iterative bi-partitioning solution, consisting of an initial and a refinement phase. We also implemented POISE on a DPDK-based platform. Using the important application of emergency response, our experimental results show that POISE outperforms state-of-the-art solutions, demonstrating its effectiveness in timely delivery and load-sharing.

Optimized D-RAN Aware Data Retrieval for 5G Information Centric Networks

Optimized D-RAN Aware Data Retrieval for 5G Information Centric Networks

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.

NECS-based Cache Management in the Information Centric Networking

The Information Centric Networking ICN architectures are proposed to overcome the problems of the actual internet architecture. One of the main straight points of the ICN architectures is the in-network caching. The ICN performance is influenced by efficiency of the adopted caching strategy which manages the contents in the network and decides where caching them. However, the major issue which faces the caching strategies in the ICN architectures is the strategic election of the cache routers to store the data through its delivery path. This will reduce congestion, optimize the distance between the consumers and the required data furthermore improve latency and alleviate the viral load on the servers. In this paper, we propose a new efficient caching strategy for the Named Data Networking architecture NDN named NECS which is the most promising architecture between all the ICN architectures. The proposed strategy reduces the traffic redundancy, eliminates the useless replication of contents and improves the replay time for users due to the strategic position of cache routers. Besides, we evaluate the performance of this proposed strategy and we compare it with three other NDN caching strategies, using the simulator network environment NdnSIM. On the basis of the simulations carried out, we obtained interesting and convincing results.

Information‐centric networking driven psychology recognition and health conduction of undergraduates

It is considerably significant to recognize the psychology of undergraduates especially during the period of COVID‐19 outbreak. This letter proposes an Information‐Centric Networking (ICN) driven psychology recognition and health conduction method based on the active data collection mode, that is, all undergraduates submit their psychology data to manger without protest by the special sensor tool. Meanwhile, the involved undergraduates and the management center construct a large network model. In order to support the mobility of undergraduates, this letter exploits ICN paradigm to help the management and transmission of psychology data. In addition, this management center deploys Deep Belief Network (DBN) to analyze the submitted psychology data. Finally, this letter makes a practical simulation on campus, and the experimental results show that the proposed psychology control method not only has good recognition effect but also contributes to health conduction. To be specific, the proposed method can improve about 2.6% psychology recognition accuracy and decrease about 46.5% psychology recognition time.

Serving at the Edge: An Edge Computing Service Architecture Based on ICN

Different from cloud computing, edge computing moves computing away from the centralized data center and closer to the end-user. Therefore, with the large-scale deployment of edge services, it becomes a new challenge of how to dynamically select the appropriate edge server for computing requesters based on the edge server and network status. In the TCP/IP architecture, edge computing applications rely on centralized proxy servers to select an appropriate edge server, which leads to additional network overhead and increases service response latency. Due to its powerful forwarding plane, Information-Centric Networking (ICN) has the potential to provide more efficient networking support for edge computing than TCP/IP. However, traditional ICN only addresses named data and cannot well support the handle of dynamic content. In this article, we propose an edge computing service architecture based on ICN, which contains the edge computing service session model, service request forwarding strategies, and service dynamic deployment mechanism. The proposed service session model can not only keep the overhead low but also push the results to the computing requester immediately once the computing is completed. However, the service request forwarding strategies can forward computing requests to an appropriate edge server in a distributed manner. Compared with the TCP/IP-based proxy solution, our forwarding strategy can avoid unnecessary network transmissions, thereby reducing the service completion time. Moreover, the service dynamic deployment mechanism decides whether to deploy an edge service on an edge server based on service popularity, so that edge services can be dynamically deployed to hotspot, further reducing the service completion time.