Content Caching Research Articles

Energy-Efficient Aerial STAR-RIS-Aided Computing Offloading and Content Caching for Wireless Sensor Networks

Unmanned aerial vehicle (UAV)-based wireless sensor networks (WSNs) hold great promise for supporting ground-based sensors due to the mobility of UAVs and the ease of establishing line-of-sight links. UAV-based WSNs equipped with mobile edge computing (MEC) servers effectively mitigate challenges associated with long-distance transmission and the limited coverage of edge base stations (BSs), emerging as a powerful paradigm for both communication and computing services. Furthermore, incorporating simultaneously transmitting and reflecting reconfigurable intelligent surfaces (STAR-RISs) as passive relays significantly enhances the propagation environment and service quality of UAV-based WSNs. However, most existing studies place STAR-RISs in fixed positions, ignoring the flexibility of STAR-RISs. Some other studies equip UAVs with STAR-RISs, and UAVs act as flight carriers, ignoring the computing and caching capabilities of UAVs. To address these limitations, we propose an energy-efficient aerial STAR-RIS-aided computing offloading and content caching framework, where we formulate an energy consumption minimization problem to jointly optimize content caching decisions, computing offloading decisions, UAV hovering positions, and STAR-RIS passive beamforming. Given the non-convex nature of this problem, we decompose it into a content caching decision subproblem, a computing offloading decision subproblem, a hovering position subproblem, and a STAR-RIS resource allocation subproblem. We propose a deep reinforcement learning (DRL)–successive convex approximation (SCA) combined algorithm to iteratively achieve near-optimal solutions with low complexity. The numerical results demonstrate that the proposed framework effectively utilizes resources in UAV-based WSNs and significantly reduces overall system energy consumption.

Joint Content Caching, Service Placement, and Task Offloading in UAV-Enabled Mobile Edge Computing Networks

Joint Content Caching, Service Placement, and Task Offloading in UAV-Enabled Mobile Edge Computing Networks

A review of traffic-aware content caching vehicular social networks in the internet of vehicles

A review of traffic-aware content caching vehicular social networks in the internet of vehicles

Power-Aware User Association and Content Caching Algorithm for Delay-Energy Tradeoff in Cache-Enabled Heterogeneous Cellular Networks

Power-Aware User Association and Content Caching Algorithm for Delay-Energy Tradeoff in Cache-Enabled Heterogeneous Cellular Networks

On a Hierarchical Content Caching and Asynchronous Updating Scheme for Non-Terrestrial Network-Assisted Connected Automated Vehicles

On a Hierarchical Content Caching and Asynchronous Updating Scheme for Non-Terrestrial Network-Assisted Connected Automated Vehicles

Multi-Agent Reinforcement Learning based Edge Content Caching for Connected Autonomous Vehicles in IoV

Connected Autonomous Vehicle (CAV) Driving, as a data-driven intelligent driving technology within the Internet of Vehicles (IoV), presents significant challenges to the efficiency and security of real-time data management. The combination of Web3.0 and edge content caching holds promise in providing low-latency data access for CAVs’ real-time applications. Web3.0 enables the reliable pre-migration of frequently requested content from content providers to edge nodes. However, identifying optimal edge node peers for joint content caching and replacement remains challenging due to the dynamic nature of traffic flow in IoV. Addressing these challenges, this article introduces GAMA-Cache, an innovative edge content caching methodology leveraging Graph Attention Networks (GAT) and Multi-Agent Reinforcement Learning (MARL). GAMA-Cache conceptualizes the cooperative edge content caching issue as a constrained Markov decision process. It employs a MARL technique predicated on cooperation effectiveness to discern optimal caching decisions, with GAT augmenting information extracted from adjacent nodes. A distinct collaborator selection mechanism is also developed to streamline communication between agents, filtering out those with minimal correlations in the vector input to the policy network. Experimental results demonstrate that, in terms of service latency and delivery failure, the GAMA-Cache outperforms other state-of-the-art MARL solutions for edge content caching in IoV.

A Survey on Privacy-Preserving Caching at Network Edge: Classification, Solutions, and Challenges

Caching content at the edge network is a popular and effective technique widely deployed to alleviate the burden of network backhaul, shorten service delay and improve service quality. However, there has been some controversy over privacy violations in caching content at the edge network. On the one hand, the multi-access open edge network provides an ideal entrance or interface for external attackers to obtain private data from edge caches by extracting sensitive information. On the other hand, privacy can be infringed on by curious edge caching providers through caching trace analysis targeting the achievement of better caching performance or higher profits. Therefore, an in-depth understanding of privacy issues in edge caching networks is vital and indispensable for creating a privacy-preserving caching service at the edge network. In this article, we are among the first to fill this gap by examining privacy-preserving techniques for caching content at the edge network. Firstly, we provide an introduction to the background of privacy-preserving edge caching (PPEC). Next, we summarize the key privacy issues and present a taxonomy for caching at the edge network from the perspective of private information. Additionally, we conduct a retrospective review of the state-of-the-art countermeasures against privacy leakage from content caching at the edge network. Finally, we conclude the survey and envision challenges for future research.

Energy-Efficient Green Information Centric Networking for Future Wireless Communications

Energy-efficient green information-centric networking (EEGICN) is proposed in this paper for advancing future wireless communication networks by addressing the challenge of energy consumption. This model can adapt the power consumption of network nodes to optimized values according to the associated link utilization. The model aimed to reduce energy consumption and increase network performance and stability. The EEGICN model incorporates efficient routing mechanisms, content caching strategies, and energy-intelligent communication protocols to improve resource utilization across the network infrastructure. EEGICN minimizes large data transmission, reduces power consumption, and reduces network congestion. Popular resources are cached in key network locations, and proximity data is exchanged to achieve this. The model also includes dynamic power management algorithms that adapt to changing traffic demand and network conditions to provide consistent performance across a variety of operational scenarios. In comparison to current wireless network systems that employ various forms of cache, the evaluation findings demonstrated that EEGICN can increase network efficiency by dramatically lowering the number of hops and energy consumption. Future networks may find this application to be a quick and easy way to transmit content.

Optimizing proactive content caching with mobility aware deep reinforcement & asynchronous federate learning in VEC

Edge caching in the Internet of Vehicles (IoV) can reduce backhaul strain and content access delay. However, due to the constant changes in vehicle requests, offloading applications to edge servers is crucial for efficiently anticipating and caching popular content. Additionally, conventional data-sharing techniques are inadequate for this task due to their inability to preserve the privacy of vehicular users (VU). To overcome these issues, we propose a cooperative proactive content caching system incorporating Asynchronous federated learning and Deep reinforcement learning named PCAD that leverages the strengths of Dueling Deep Q-Networks and Prioritized Experience Replay in vehicular edge computing. PCAD lowers the latency of content access by prefetching contents that are popular beforehand caching them on edge nodes and cutting the waiting time for every vehicle to complete training as well as uploading local models before updating the global model. Additionally, we investigate intelligent caching decisions based on content prediction. Comprehensive experimental evaluations indicate that our proposed approach significantly outperforms existing benchmark caching techniques. More specifically, our suggested approach works better than DDQN, c-ϵ-greedy, and PCAD without DRL methods and the cache hit rate improves by approximately 4.25%, 11.23%, and 25.82%, respectively, as the cache capacity hits 400 MB.

ANALYSIS OF THE MAIN REQUIREMENTS FOR 5G/6G NETWORKS

Not long ago, the fifth-generation (5G) telecommunications standard was introduced, and active development is already underway for the sixth-generation (6G) standard. The subject of the study is the key characteristics and requirements of 5G/6G networks. The purpose of the research is to conduct a comparative analysis of the main features of communication networks built using 5G and 6G technologies. The following results have been obtained. Several key aspects of research directions and new technologies for designing 6G radio access networks, which meet the requirements of future wireless communication systems, have been examined. The main characteristics of terrestrial communication networks that must meet the declared requirements for 6G applications are analyzed in detail. Requirements for fifth-generation communication networks are identified, including distributed processing and analysis of large data volumes combined with content caching and delivery to mobile devices, support for ultra-low latency, scalability of arrays, and mobile communication management. These are compared with the projected features of sixth-generation communication networks. Conclusions. The transition to 6G will inevitably intensify the requirements for fifth-generation communication networks and introduce new ones to ensure the operation of systems demanding ultra-high reliability, high availability, and ultra-low response times.

Content delivery network solutions for the CMS experiment: The evolution towards HL-LHC

The Large Hadron Collider at CERN in Geneva is poised for a transformative upgrade, preparing to enhance both its accelerator and particle detectors. This strategic initiative is driven by the tenfold increase in proton-proton collisions anticipated for the forthcoming high-luminosity phase scheduled to start by 2029. The vital role played by the underlying computational infrastructure, the World-Wide LHC Computing Grid, in processing the data generated during these collisions underlines the need for its expansion and adaptation to meet the demands of the new accelerator phase. The provision of these computational resources by the worldwide community remains essential, all within a constant budgetary framework. While technological advancements offer some relief for the expected increase, numerous research and development projects are underway. Their aim is to bring future resources to manageable levels and provide cost-effective solutions to effectively handle the expanding volume of generated data. In the quest for optimized data access and resource utilization, the LHC community is actively investigating Content Delivery Network (CDN) techniques. These techniques serve as a mechanism for the cost-effective deployment of lightweight storage systems that support both, traditional and opportunistic compute resources. Furthermore, they aim to enhance the performance of executing tasks by facilitating the efficient reading of input data via caching content near the end user. A comprehensive study is presented to assess the benefits of implementing data cache solutions for the Compact Muon Solenoid (CMS) experiment. This in-depth examination serves as a use-case study specifically conducted for the Spanish compute facilities, playing a crucial role in supporting CMS activities. Data access patterns and popularity studies suggest that user analysis tasks benefit the most from CDN techniques. Consequently, a data cache has been introduced in the region to acquire a deeper understanding of these effects. In this paper, the details of the implementation of a data cache system in the PIC Tier-1 compute facility are presented. It includes insights into the developed monitoring tools and discusses the positive impact on CPU usage for analysis tasks executed in the region. The study is augmented by simulations of data caches, with the objective of discerning the most optimal requirements in both size and network connectivity for a data cache serving the Spanish region. Additionally, the study delves into the cost benefits associated with deploying such a solution in a production environment. Furthermore, it investigates the potential impact of incorporating this solution into other regions of the CMS computing infrastructure.

Agile C-states: A Core C-state Architecture for Latency Critical Applications Optimizing both Transition and Cold-Start Latency

Latency-critical applications running in modern datacenters exhibit irregular request arrival patterns and are implemented using multiple services with strict latency requirements (30–250μs). These characteristics render existing energy-saving idle CPU sleep states ineffective due to the performance overhead caused by the state’s transition latency. Besides the state transition latency, another important contributor to the performance overhead of sleep states is the cold-start latency, or in other words, the time required to warm up the microarchitectural state (e.g., cache contents, branch predictor metadata) that is flushed or discarded when transitioning to a lower-power state. Both the transition latency and cold-start latency can be particularly detrimental to the performance of latency critical applications with short execution times. While prior work focuses on mitigating the effects of transition and cold-start latency by optimizing request scheduling, in this work we propose a redesign of the core C-state architecture for latency-critical applications. In particular, we introduce C6Awarm, a new Agile core C-state that drastically reduces the performance overhead caused by idle sleep state transition latency and cold-start latency while maintaining significant energy savings. C6Awarm achieves its goals by (1) implementing medium-grained power gating, (2) preserving the microarchitectural state of the core, and (3) keeping the clock generator and PLL active and locked. Our analysis for a set of microservices based on an Intel Skylake server shows that C6Awarm manages to reduce the energy consumption by up to 70% with limited performance degradation (at most 2%).

Effects of mound building and caching by steppe mouse (Mus spicilegus Petényi) on the vegetation in agroecosystems

Several rodent species are considered ecosystem engineers. They exert profound changes in agroecosystems by disturbing the soil during their activities. The steppe mouse (Mus spicilegus) inhabits various agroecosystems and constructs conspicuous mounds for overwintering using piled up plant material and soil. These mounds are widespread in many agroecosystems and may significantly affect the vegetation. In our study, we evaluated the effect of mound building activity of the steppe mouse on the vegetation of agroecosystems in Hungary. We sampled the cache content of 90 mounds in total located in old fields, alfalfa fields, and annual crop fields, and surveyed the aboveground vegetation of the mounds and their surrounding undisturbed matrix in 39 paired plots. Mice cached large amounts of seeds belonging mostly to weeds. In total we found 50,413 germinable seeds of 30 species in the cache content samples. However, the mound vegetation and the cache shared only a few species, suggesting that seeds cached by the mice do not contribute to the regenerating vegetation on the mounds. Soil disturbance by mice created distinct vegetation patches with species composition and structure different from the neighbouring undisturbed matrix. Early secondary successional vegetation patches on mounds introduced small-scale heterogeneity into the homogenous agricultural landscape, increased plant diversity and provided distinct flower resources for pollinators. The detected differences in the aboveground vegetation between the mound and the matrix in the studied habitats suggest that the steppe mouse acts as a facultative engineer species in agroecosystems.

Learning-based cooperative content caching and sharing for multi-layer vehicular networks

Caching and sharing the content files is critical and fundamental for various future vehicular applications. However, how to satisfy the content demands in a timely manner with limited storage is an open issue owing to the high mobility of vehicles and the unpredictable distribution of dynamic requests. To better serve the requests from the vehicles, a cache-enabled multi-layer architecture, consisting of a Micro Base Station (MBS) and several Small Base Stations (SBSs), is proposed in this paper. Considering that vehicles usually travel through the coverage of multiple SBSs in a short time period, the cooperative caching and sharing strategy is introduced, which can provide comprehensive and stable cache services to vehicles. In addition, since the content popularity profile is unknown, we model the content caching problems in a Multi-Armed Bandit (MAB) perspective to minimize the total delay while gradually estimating the popularity of content files. The reinforcement learning-based algorithms with a novel Q-value updating module are employed to update the caching files in different timescales for MBS and SBSs, respectively. Simulation results show the proposed algorithm outperforms benchmark algorithms with static or varying content popularity. In the high-speed environment, the cooperation between SBSs effectively improves the cache hit rate and further improves service performance.

A vehicular edge computing content caching solution based on content prediction and D4PG

A vehicular edge computing content caching solution based on content prediction and D4PG

Optimization of IoT perceived content caching in F-RANs: Minimum retrieval delay and resource extension with performance sensitivity

In the Internet of Things (IoT) perceived applications of monitoring the states of the environment, a feasible technology is to use fog radio access networks (F-RANs) to alleviate the problems of long response time and cloud server bottlenecks in cloud computing. In response to the above problems, this work investigates the problem of minimizing the retrieval delay of IoT contents in F-RANs under the constraints of system resources. The problem is formulated as an integer linear programming (ILP) model. Then, a polynomial-time method with linear programming (LP) relaxation and rounding is proposed to approximate the optimal solution of the problem. Through proof, the method can obtain a feasible solution with a bounded approximation ratio in polynomial time. The conducted simulations validate that the obtained feasible solution is very close to the optimal one. On the other hand, when the system resources are not enough to meet the continuous growth of content retrieval and need to be expanded, this work further establishes an association relation between cached contents and system resources. Based on the above relation, the second method of expanding system resources with performance sensitivity is proposed to provide the service provider with an effective and economical expansion of system resources. It utilizes a predefined system parameter in balancing the trade-off between the approximation ratio to the optimal solution of the problem and the extended system resources. The solution obtained by the second method is also proved to have a bounded approximation ratio.

DRL-based Content Caching Strategy With Efficient User Preference Predictions in UAV-assisted VEC

DRL-based Content Caching Strategy With Efficient User Preference Predictions in UAV-assisted VEC

Towards Analysing Cache-Related Preemption Delay in Non-Inclusive Cache Hierarchies

The impact of preemptions has to be considered when determining the schedulability of a task set in a preemptively scheduled system. In particular, the contents of caches can be disturbed by a preemption, thus creating context-switching costs. These context-switching costs occur when a preempted task needs to reload data from memory after a preemption. The additional delay created by this effect is termed cache-related preemption delay (CRPD). The analysis of CRPD has been extensively studied for single-level caches in the past. However, for two-level caches, the analysis of CRPD is still an emerging area of research. In contrast to a single-level cache, which is only affected by direct preemption effects, the second-level cache in a two-level hierarchy can be subject to indirect interference after a preemption. Accesses that could be served from the L1 cache in the absence of preemptions, may be forwarded to the L2 cache, as the relevant data was evicted by a preemption. These accesses create the indirect interference in the L2 cache and can cause further evictions. Recently, a CRPD analysis for two-level non-inclusive cache hierarchies was proposed. In this article, we show that this state-of-the-art analysis is unsafe as it potentially underestimates the CRPD. Furthermore, we show that the analysis is pessimistic and can overestimate the indirect preemption effects. To address these issues, we propose a novel analysis approach for the CRPD in a two-level non-inclusive cache hierarchy. We prove the correctness of the presented approach based on the set of feasible program execution traces. We implemented the presented approach in a worst-case execution time (WCET) analysis tool and compared the performance to existing analysis methods. Our evaluation shows that the presented analysis increases task set schedulability by up to 14 percentage points compared with the state-of-the-art analysis.

Capacity and delay performance analysis for large-scale UAV-enabled wireless networks

In this paper, we analyze the capacity and delay performance of a large-scale Unmanned Aerial Vehicle (UAV)-enabled wireless network, in which untethered and tethered UAVs deployed with content files move along with mobile Ground Users (GUs) to satisfy their coverage and content delivery requests. We consider the case where the untethered UAVs are of limited storage, while the tethered UAVs serve as the cloud when the GUs cannot obtain the required files from the untethered UAVs. We adopt the Ornstein-Uhlenbeck (OU) process to capture the mobility pattern of the UAVs moving along the GUs and derive the compact expressions of the coverage probability and capacity of our considered network. Using tools from martingale theory, we model the traffic at UAVs as a two-tier queueing system. Based on this modeling, we further derive the analytical expressions of the network backlog and delay bounds. Through numerical results, we verify the correctness of our analysis and demonstrate how the capacity and delay performance can be significantly improved by optimizing the percentage of the untethered UAVs with cached contents.

Cluster-based cooperative fog caching for scalable coded videos of multiple content providers

Efficient content caching in video streaming services is important for improving user experience as well as reducing network bandwidth consumption. Fog caching combined with scalable video coding (SVC) has the potential to significantly improve caching efficiency. However, challenges such as the limited storage capacity of fog nodes and determining the optimal number of SVC layers must be overcome for their effective adoption. This becomes more complicated with multiple content providers requiring shared cache resources. To the best of our knowledge, no existing research has simultaneously tackled all these aspects. In this paper, we present Cluster-based Cooperative Fog Caching (CCo-Fog), a holistic caching strategy that enables multiple content providers to share the scarce storage of fog nodes in a multi-tier fog network to judiciously cache SVC videos in a cooperative manner. In particular, CCo-Fog consists of a cluster-based storage partitioning method and tier-wise cooperative content placement policies. The partitioning method distributes the storage of each fog node to multiple content providers for users clustered based on their population density and their proximity to fog nodes. The content placement policies determine the optimal number of SVC layers of each video for different tiers of the fog network by solving a latency-aware content placement optimization problem. Our evaluations on a real-world dataset and various configurations demonstrate the efficacy of CCo-Fog, showing a reduction in latency by about 60% and an increase in fog hit ratio by about 20% on average, compared to state-of-the-art caching strategies.