In-network Caching Research Articles

ICache: An Intelligent Caching Scheme for Dynamic Network Environments in ICN-Based IoT Networks

Advanced network technologies and ubiquitous connected devices are boosting the development of the Internet of Things (IoT) at an unprecedented pace. However, as most of the connected IoT devices are battery powered, the energy consumption issue has become the bottleneck of the IoT’s development. Caching is a promising approach to reducing the energy consumption of the battery-powered devices since the requested data packets can be retrieved from intermediate nodes in the network, e.g., routers, instead of from the remote battery-powered IoT devices, which allows the IoT devices to spend more time in the sleep mode. To realize in-network caching and overcome the IP-based networks’ inefficiency support for IoT, building IoT over information-centric networking (ICN) is a promising approach advocated by researchers. However, existing works in this area assume the network environments are static, which hinders the development of existing approaches in the real dynamic network environments. In this article, we leverage the deep <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$Q$ </tex-math></inline-formula> -networks (DQNs) to propose an intelligent caching scheme (named as iCache) that can automatically adjust the caching nodes’ caching parameters to make caching decisions for the dynamic network environments. Extensive evaluations were conducted and the results show that the proposed iCache outperforms the existing approaches in terms of the total energy consumption (e.g., more than 29% reduction compared to the caching transient data (CTD) caching scheme) and the average number of hops (e.g., more than 20% reduction compared to the CTD caching scheme).

A Survey on In-Network Computing: Programmable Data Plane and Technology Specific Applications

In comparison with cloud computing, edge computing offers processing at locations closer to end devices and reduces the user experienced latency. The new recent paradigm of in-network computing employs programmable network elements to compute on the path and prior to traffic reaching the edge or cloud servers. It advances common edge/cloud server based computing through proposing line rate processing capabilities at closer locations to the end devices. This paper discusses use cases, enabler technologies and protocols for in-network computing. According to our study, considering programmable data plane as an enabler technology, potential in-network computing applications are in-network analytics, in-network caching, in-network security, and in-network coordination. There are also technology specific applications of in-network computing in the scopes of cloud computing, edge computing, 5G/6G, and NFV. In this survey, the state of the art, in the framework of the proposed categorization, is reviewed. Furthermore, comparisons are provided in terms of a set of proposed criteria which assess the methods from the aspects of methodology, main results, as well as application-specific criteria. Finally, we discuss lessons learned and highlight some potential research directions.

Cooperative Caching Strategy Based on Two-Layer Caching Model for Remote Sensing Satellite Networks

In Information Centric Networking (ICN) where content is the object of exchange, in-network caching is a unique functional feature with the ability to handle data storage and distribution in remote sensing satellite networks. Setting up cache space at any node enables users to access data nearby, thus relieving the processing pressure on the servers. However, the existing caching strategies still suffer from the lack of global planning of cache contents and low utilization of cache resources due to the lack of fine-grained division of cache contents. To address the issues mentioned, a cooperative caching strategy (CSTL) for remote sensing satellite networks based on a two-layer caching model is proposed. The two-layer caching model is constructed by setting up separate cache spaces in the satellite network and the ground station. Probabilistic caching of popular contents in the region at the ground station to reduce the access delay of users. A content classification method based on hierarchical division is proposed in the satellite network, and differential probabilistic caching is employed for different levels of content. The cached content is also dynamically adjusted by analyzing the subsequent changes in the popularity of the cached content. In the two-layer caching model, ground stations and satellite networks collaboratively cache to achieve global planning of cache contents, rationalize the utilization of cache resources, and reduce the propagation delay of remote sensing data. Simulation results show that the CSTL strategy not only has a high cache hit ratio compared with other caching strategies but also effectively reduces user request delay and server load, which satisfies the timeliness requirement of remote sensing data transmission.

QoE-Aware Efficient Content Distribution Scheme For Satellite-Terrestrial Networks

The satellite-terrestrial networks (STN) utilize the spacious coverage and low transmission latency of the Low Earth Orbit (LEO) constellation to transfer requested content for subscribers especially in remote areas. With the development of storage and computing capacity of satellite onboard equipment, it is considered promising to leverage in-network caching technology on STN to improve content distribution efficiency. However, traditional caching and distribution schemes are not suitable in STN, considering dynamic satellite propagation links and time-varying topology. More specifically, the unevenness of user distribution heightens difficulties for assurance of user quality of experience. To address these problems, we first propose a density-based network division algorithm. The STN is divided into a series of blocks with different sizes to amortize the data delivery costs. To deploy the caching satellites, we analyze the link connectivity and propose an approximate minimum coverage vertex set algorithm. Then, a novel cache node selection algorithm is designed for optimal subscriber matching. On the basis of time-varying network model, the STN cache content updating mechanism is derived to enable a stable and sustainable quality of user experience. The simulation results demonstrate that the proposed user-oriented STN content distribution scheme can obviously reduce the average propagation delay and network load under different network conditions and has better stability and self-adaptability under continuous time variation.

NCDE: In-Network Caching for Directory Entries to Expedite Data Access in Tiled-Chip Multiprocessors

The processing of data-intensive applications, followed by an unprecedented amount of data traffic, drives explosive accesses to the memory subsystem. The overloaded memory subsystem experiences increased data access latency. To expedite data access, a network caching technique that leverages network-on-chip (NoC) virtual channels (VCs) as an expanded memory subsystem has emerged. Previous network caching studies focused on utilizing VCs on the NoC’s local input port as a victim cache to reduce local data access latency. In contrast to previous studies, we explore the opportunity of mitigating problems associated with shared data access via in-network caching for directory entries (NCDE), which can utilize every input port’s VCs to hold directory entries. NCDE exploits VCs as the victim and prefetch buffers of the directory entries, each reducing directory eviction-induced invalidations and simplifying the cache-to-cache (C2C) data transfer. The effectiveness of NCDE was evaluated using a gem5 full-system simulator, and the results show that the average memory access time (AMAT) and workload execution time were reduced by 7.69% and 5.82%, respectively. As a cost for accelerating the data access latency, implementing NCDE incurs a negligible router area overhead of 1.56%.

Design of Multi-Armed Bandit-Based Routing for in-Network Caching

Design of Multi-Armed Bandit-Based Routing for in-Network Caching

Logically-Centralized SDN-Based NDN Strategies for Wireless Mesh Smart-City Networks

The Internet of Things (IoT) is a key technology for smart community networks, such as smart-city environments, and its evolution calls for stringent performance requirements (e.g., low delay) to support efficient communication among a wide range of objects, including people, sensors, vehicles, etc. At the same time, these ecosystems usually adopt wireless mesh technology to extend their communication range in large-scale IoT deployments. However, due to the high range of coverage, the smart-city WMNs may face different network challenges according to the network characteristic, for example, (i) areas that include a significant number of wireless nodes or (ii) areas with frequent dynamic changes such as link failures due to unstable topologies. Named-Data Networking (NDN) can enhance WMNs to meet such IoT requirements, thanks to the content naming scheme and in-network caching, but it necessitates adaptability to the challenging conditions of WMNs. In this work, we aim at efficient end-to-end NDN communication in terms of performance (i.e., delay), performing extended experimentation over a real WMN, evaluating and discussing the benefits provided by two SDN-based NDN strategies: (1) a dynamic SDN-based solution that integrates the NDN operation with the routing decisions of a WMN routing protocol; (2) a static one which based on SDN-based clustering and real WMN performance measurements. Our key contributions include (i) the implementation of two types of NDN path selection strategies; (ii) experimentation and data collection over the w-iLab.t Fed4FIRE+ testbed with real WMN conditions; (ii) real measurements released as open-data, related to the performance of the wireless links in terms of RSSI, delay, and packet loss among the wireless nodes of the corresponding testbed.

Poche: A Priority-Based Flow-Aware In-Network Caching Scheme in Data Center Networks

Datacenters currently deploy shallow-buffered switches to achieve low latency by avoiding long waiting time in the data plane. However, the limited buffer space in the switch causes the frequent overflow and the notorious TCP incast problem. Moreover, the simple scheduling strategy in buffer deprives the switch of the ability to offer deeply differentiated services. Therefore, we present a novel priority-based flow-aware in-network caching scheme, named Poche, which supplies more control capabilities for the network side through introducing some additional cache resource into switches. Poche classifies network traffic into multiple priorities according to the latency requirements of flows. The end server adds priority tags to packets and sets different RTO values for flows with distinct priorities. The switch monitors the buffer utilization of each port and performs the priority-based flow-aware caching and injecting strategies based on the analysis of the scheduling model between the buffer and cache. We conduct comprehensive experiments to compare Poche with the state-of-the-art traffic optimization schemes. The results demonstrate that Poche can reduce the FCTs of latency-sensitive flows by at least 59.1% and improve the network throughput by at least 54.4%, while ensuring the finite cached volume and effectively addressing the incast problem.

Selective Content Retrieval in Information-Centric Networking.

Recently, novel networking architectures have emerged to cope with the fast-evolving and new Internet utilisation patterns. Information-Centric Networking (ICN) is a prominent example of this architecture. By perceiving content as the core element of the networking functionalities, ICN opens up a whole new avenue of information exchange optimisation possibilities. This paper presents an approach that progresses the base operation of ICN and leverages content identification right at the network layer, allowing to selectively retrieve partial pieces of information from content already present in ICN in-network caches. Additionally, this proposal enables information producers to seamlessly offload some content processing tasks into the network. The concept is discussed and demonstrated through a proof-of-concept prototype targeting an Internet of Things (IoT) scenario, where consumers retrieve specific pieces of the whole information generated by sensors. The obtained results showcase reduced traffic and storage consumption at the core of the network.

A hybrid caching strategy for information-centric satellite networks based on node classification and popular content awareness

Low Earth Orbit (LEO) satellite networks are inexpensive to deploy and have wide coverage, and are widely available for differentiated content distribution services. With the development of on-board storage and computing capabilities, in-network caching technology in information centric networking (ICN) has proven to be an effective way to increase the throughput and content distribution efficiency of satellite networks. However, traditional caching and distribution schemes, which do not take into account the high-speed motion of satellite nodes and dynamic changes in topology, are not applicable to satellite networks. To address these issues, a hybrid caching strategy for satellite networks based on node classification and popular content awareness (NCPCA) is proposed. Firstly, the time slot partitioning method based on interlayer similarity is proposed to transform the dynamically changing process into a set of time slots with stable topology. Next, the satellite nodes are dynamically divided into two categories by fully considering the changes in connection relationships and interaction order during the spatial–temporal evolution of the satellite nodes. Nodes with satellite topological and functional characteristics are screened out as core nodes with TOPSIS algorithm, and the remaining nodes are regarded as edge nodes. Finally, a probabilistic caching scheme based on content popularity is adopted with core nodes as caching nodes to ensure caching performance and promote the diversity of cached content. Simulation results show that this strategy can effectively improve cache hit rate, reduce user request delay and content fetching hops, and promote the stable operation of satellite networks compared with other caching strategies.

Exploiting Non-Cooperative Game Against Cache Pollution Attack in Vehicular Content Centric Network

Vehicular Content Centric Network (VCCN) has been proposed to address the issues of user mobility and sporadic connectivity in Vehicular Ad hoc Network (VANET). The in-network caching of VCCN can indeed improve the performance of content distribution in terms of cache hit and delivery latency by making each node store frequently accessed data. However, data caching unfortunately suffers from Cache Pollution Attack (CPA) that sends out fabricated requests to pollute the data cache. To prevent the degradation of network performance caused by such an attack, we propose a detection and defense scheme for CPA by adopting game theory. We model the attack scenario into a non-cooperative game model. First, we prove the non-existence of pure strategy Nash Equilibrium (NE) in the attacker and defender game, and propose a normal form game model with complete information and an extensive Bayesian form game model with incomplete information. Under the guidance of NE, we propose a punishment strategy to prevent the conspiracy attack and make the attackers behave normally. Moreover, we propose a cooperative detection scheme to give the Road Side Unit (RSU) the final decision on CPA based on the direct and indirect suspicious lists which are generated by each node according to the observed traffic pattern. Simulation evaluations demonstrate that our scheme outperforms state-of-the-art schemes in terms of cache hit, detecting ratio, and cache accuracy for detecting and defending CPA.

A Cooperative Caching Scheme for VCCN With Mobility Prediction and Consistent Hashing

In order to mitigate the performance degradation of intermittent vehicular network caused by traffic mobility and sporadic connectivity issues, Vehicular Content Centric Network (VCCN) has been proposed to apply many technologies in Content Centric Network (CCN) into vehicular ad hoc networks. The open in-network caching strategy of CCN enables sharing and coordination of the cached data among multiple nodes as an efficient data access without relying on remote fetching. Nonetheless, few studies have considered the effective use of overall cache capacity with these cooperative nodes, especially the issues of cache duplication. Furthermore, most content replacement polices have ignored the needs of cooperative contents when making cache decisions. In this paper, we design a novel Cooperative Caching scheme by using Mobility Prediction and Consistent Hash for VCCN (called CCMPCH). Specifically, based on the observation that vehicles with the same trajectory are more likely to maintain stable communication links, we adopt Prediction by Partial Matching (PPM) to forecast each vehicle’s path and cluster the vehicles with similar future path, moving direction, and moving speed into one group. In each cluster, the consistent hash algorithm is used to allocate contents among cooperative nodes, thereby reducing unnecessary cache duplication while maintaining strong content availability. A popularity-based cache replacement policy is also developed to prioritize cooperative contents. We evaluate CCMPCH via extensive simulations, which demonstrates its higher cache hit ratio, shorter content access delay, and lower hop count compared to other state-of-the-art schemes.

Detection of Cache Pollution Attack Based on Federated Learning in Ultra-Dense Network

Ultra-Dense Network (UDN) as one of the key technologies of 5G aims to increase the capacity per area of the current 4G network by 1,000-fold through the deployment of dense Small Base Stations (SBSs). To reduce the traffic on backhaul links, Content-Centric Networking (CCN) as a promising network architecture has been applied to UDN recently. However, its in-network caching mechanism is subject to Cache Pollution Attack (CPA), where attackers aim to occupy limited caching space with unpopular contents. Existing studies focusing on the static networks cannot be directly used in dynamic UDN scenarios. In this paper, we propose a detection and defense scheme of CPA based on federated learning, where CPA is determined by the cooperation of multiple SBSs. First, each SBS can build or join a cluster based on the metrics of distance similarity and load similarity. Then, each cluster head as the working node trains the local classifier to detect CPA based on the statistics within the cluster. The macro base station aggregates all the local models to generate an improved global classifier for all the SBSs. In our scheme, federated learning as a special case of distributed machine learning allows each cluster head to independently train the local data even when it is non-i.i.d. or unbalanced. Simulation results show that our scheme outperforms in terms of detection ratio, cache hit ratio, access delay, and false alarm ratio compared with other state-of-the-art schemes.

A DRL-Driven Intelligent Optimization Strategy for Resource Allocation in Cloud-Edge-End Cooperation Environments

Complex dynamic services and heterogeneous network environments make the asymmetrical control a curial issue to handle on the Internet. With the advent of the Internet of Things (IoT) and the fifth generation (5G), the emerging network applications lead to the explosive growth of mobile traffic while bringing forward more challenging service requirements to future radio access networks. Therefore, how to effectively allocate limited heterogeneous network resources to improve content delivery for massive application services to ensure network quality of service (QoS) becomes particularly urgent in heterogeneous network environments. To cope with the explosive mobile traffic caused by emerging Internet services, this paper designs an intelligent optimization strategy based on deep reinforcement learning (DRL) for resource allocation in heterogeneous cloud-edge-end collaboration environments. Meanwhile, the asymmetrical control problem caused by complex dynamic services and heterogeneous network environments is discussed and overcome by distributed cooperation among cloud-edge-end nodes in the system. Specifically, the multi-layer heterogeneous resource allocation problem is formulated as a maximal traffic offloading model, where content caching and request aggregation mechanisms are utilized. A novel DRL policy is proposed to improve content distribution by making cache replacement and task scheduling for arriving content requests in accordance with the information about users’ history requests, in-network cache capacity, available link bandwidth and topology structure. The performance of our proposed solution and its similar counterparts are analyzed in different network conditions.

A Path Load-Aware Based Caching Strategy for Information-Centric Networking

Ubiquitous in-network caching plays an important role in improving the efficiency of content access and distribution in Information-Centric Networks (ICN). Content placement strategies, which determine the location distribution of content replicas in the network, have a decisive impact on the performance of the cache system. Existing strategies primarily focus on pushing popular content to the network edge, aiming to improve the overall cache hit ratio while neglecting to effectively balance the traffic load between network links; this leads to insufficient utilization of network bandwidth resources and further excessive content delivery time and user QoE degradation. In this paper, a Path Load-Aware Based Caching strategy (PLABC) is proposed, in which content-related information and dynamic network-related information are comprehensively considered to make cache decisions. Specifically, the utility of caching the content at each on-path node is calculated according to the bandwidth consumption savings and the load level of the transmission path, and the node with the greatest utility value is selected as the caching node. Extensive simulations are conducted to compare the performance of PLABC with other state-of-the-art schemes by quantitative analysis. Simulation results validate the PLABC strategy’s effectiveness, especially in balancing link load and reducing content delivery time.

Deep-Reinforcement-Learning-Based Resource Allocation for Content Distribution in Fog Radio Access Networks

With the rapid development of wireless communication technologies, the emerging multimedia applications make mobile Internet traffic grow explosively while putting forward higher service requirements for the next-generation wireless networks. Therefore, how to achieve low-latency content transmission by effectively allocating heterogeneous network resources to improve the network quality of service and end-user quality of experience is a key issue to be solved urgently in the current Internet. In this article, we propose a deep reinforcement learning (DRL)-based resource allocation scheme to improve content distribution in a layered fog radio access network (FRAN). We formulate the optimal resource allocation problem as a minimal delay model, where in-network caching is deployed and the same content requests from mobile users can be aggregated in the queue of each base station. To cope with the increasing user requests and overcome capacity constraints of the FRAN, moreover, a cloud–edge cooperation offloading scheme is utilized in our model, where the integrated allocation of caching, computing, and communication resources and joint optimization between in-network caching and routing are considered to promote resource utilization and content delivery. In our solution, a new DRL policy is designed to make cross-layer cooperative caching and routing decisions for the arriving content requests according to request history information and available network resources in the system. Simulation results demonstrate that our proposed model can performs much better than the existing cloud–edge cooperation schemes in the FRAN.

Comparison of Named Data Networking Mobility Methodology in a Merged Cloud Internet of Things and Artificial Intelligence Environment.

In-network caching has evolved into a new paradigm, paving the way for the creation of Named Data Networking (NDN). Rather than simply being typical Internet technology, NDN serves a range of functions, with a focus on consumer-driven network architecture. The NDN design has been proposed as a method for replacing Internet Protocol (IP) addresses with identified content. This study adds to current research on NDN, artificial intelligence (AI), cloud computing, and the Internet of Things (IoT). The core contribution of this paper is the merging of cloud IoT (C-IoT) and NDN-AI-IoT. To be precise, this study provides possible methodological and parameter explanations of the technologies via three methods: KITE, a producer mobility support scheme (PMSS), and hybrid network mobility (hybrid NeMO). KITE uses the indirection method to transmit content using simple NDN communication; the PMSS improves producer operation by reducing handover latency; and hybrid NeMO provides a binding information table to replace the base function of forwarding information. This study also describes mathematical equations for signaling cost and handover latency. Using the network simulator ndnSIM NS-3, this study highlights producer mobility operation. Mathematical equations for each methodology are developed based on the mobility scenario to measure handover latency and signaling cost. The results show that the efficiency of signaling cost for hybrid NeMO is approximately 4% better than that of KITE and the PMSS, while the handover latency for hybrid NeMO is 46% lower than that of KITE and approximately 60% lower than that of the PMSS.

I2M: Intelligent Information Management for Rendering IoE Services in Society 5.0

In this paper, we propose an intelligent information management scheme – I2M – an two level delay-tolerant profile matching scheme for provisioning Internet-of-Everything (IoE) services in a Society 5.0. The primary aim of Society 5.0 is to provide seamless real-time IoE services using artificial intelligence (AI) and next-generation networks (NGNs). In this context, we introduce Information-Centric Satellite Network (ICSN), which is expected to enable efficient in-network caching, content delivery, and large area coverage in Society 5.0. The existing works on ICSNs suggest caching the information, requested by the user, in the satellites. However, the satellites are storage-constraint in nature. Therefore, storing information in such satellites, in the long run, may not be a suitable solution. Moreover, the existing solutions increase the delay while a cache-miss occurs in ICSN, which is unacceptable in providing real-time IoE services in Society 5.0. On the other hand, data requested by the increased number of users results in reduced network lifetime and transmission efficiency for Society 5.0 without having a suitable load balancing mechanism in the existing ICSN. To address these issues, we design I2M, which is capable of managing information in a Society 5.0. In I2M, we introduce a tabular data structure to store, update, and replace in-network information in the resource-constrained satellites. Using this tabular data structure, I2M performs a 2-level profile matching scheme, which helps to efficiently access the in-network information and reduce the delay for cache-miss in satellites. Additionally, to increase the transmission efficiency and network lifetime, we apply a long-shot term memory (LSTM)-based intelligent load balancing mechanism in I2M. The extensive simulation results show that I2M outperforms as compared to the existing schemes for ICSNs, in terms of energy consumption, packet loss, and delay. We observe that I2M is capable of reducing delay by 35-55%, energy consumption by 34-54%, and packet loss by 36-53%.

On the ICN-IoT with federated learning integration of communication: Concepts, security-privacy issues, applications, and future perspectives

The individual and integration use of the Internet of Things (IoT), Information-Centric Networking (ICN), and Federated Learning (FL) have recently been used in several network-related scenarios and have consequently experienced a growing interest in the research community. Federated learning addresses the privacy and security issues of the IoT data in a decentralized manner. Also, it can be capable of training the multiple learning algorithms through local content except for exchanging data through intelligent Artificial Intelligence (AI)-based algorithms. Moreover, in ICN, the content is retrieved and stored based on the content name rather than the content location address. On the other hand, it is challenging to support the massive IoT devices by the fifth generation (5G) mobile-cellular networks. Therefore, the cellular 6G networks are expected to increase the connection capabilities by 10–100 times over 5G, which necessitates a convergence of Communication, Computing, and Caching (3C). At the same time, the in-network caching capabilities of ICN can be attractive features for IoT networks. IoT aspires to link anybody and/or everything at any time and location. However, integrating IoT with different areas is a new academic topic and is still in its infancy. As a result, this research highlights the potential of ICN for IoTs by conducting an exhaustive literature review. This work provides a comprehensive survey regarding these three recent research trends (i.e., FL, IoT, and ICN) and reviews the related state-of-the-art literature. We first describe the main features of each technology and discuss their most common and used variants. Furthermore, we envision the integration of such technologies to take advantage efficiently. Indeed, we consider their group-wise (FL-ICN-IoT) utilization based on the need for more robust security and privacy. Additionally, we cover the application fields of these technologies both individually and combinedly. Finally, we discuss the open issues of the reviewed research and describe potential directions for future avenues regarding integrating IoT, ICN, and FL technologies.

PbCP: A profit-based cache placement scheme for next-generation IoT-based ICN networks

The large number of connected devices generating a massive amount of data in the emerging technologies such as the Internet of Things (IoT), will surpass the capabilities of the current Internet infrastructure. Therefore, it is essential to design a new communication paradigm to meet the demands and requirements of new applications. Information-Centric Networking (ICN) is a new candidate for future Internet architecture that aims at addressing different challenges in the currently used host-centric Internet. In ICN, the data/content is searched, routed, located, and retrieved through the name of the content rather than the address of data source. ICN also enables in-network caching where the intermediate nodes can cache the content. In-network caching helps in improving the network scalability and reduces the content retrieval delay. To date, multiple caching schemes have been designed for IoT data management in ICN; however, most of them suffer from scalability or ignore constraints on the IoT devices. Moreover, the placement of content in a large-scale environment needs further improvement and optimization since it impacts overall network performance. To fill the gaps, in this paper, we combine various metrics that affect caching performance. We formulate the content placement as an optimization problem and then propose a profit-based caching scheme that harnesses the benefits of the Tabu local search algorithm. The simulation results and comparative analysis show that the proposed strategy outperforms the existing state-of-art schemes, notably in terms of memory resources utilization, data transmission time, content diversity ratio, and cache replacement operations.