Caching Scheme Research Articles

Mastering Real-Time Data Processing Applications : Optimization Strategies for Peak Performance

This comprehensive article explores strategies for optimizing real-time data processing applications in the era of big data and distributed systems. It examines the growing demand for real-time analytics across industries and organizations' challenges in maintaining low latency and scalability. The article discusses key optimization techniques, including leveraging the Akka framework's actor model and supervision strategies, implementing efficient data ingestion through stream processing and partitioning, utilizing caching strategies, employing robust monitoring and auto-scaling mechanisms, ensuring fault tolerance through checkpointing and graceful degradation, and adopting asynchronous communication patterns. Throughout the article, real-world case studies and performance metrics demonstrate the significant improvements these strategies can bring to system throughput, latency, and resilience in various sectors such as finance, e-commerce, telecommunications, and manufacturing.

The Impact of Server-Side Rendering on UI Performance and SEO

This article explores the impact of Server-Side Rendering (SSR) on UI performance and Search Engine Optimization (SEO) in modern web development. It examines how SSR addresses the challenges faced by Single-Page Applications (SPAs) and content-rich websites by improving initial page load times, enhancing crawlability, and facilitating faster indexing. The article delves into the technical aspects of SSR implementation, discussing popular frameworks like Next.js, Nuxt.js, and Angular Universal. It also analyzes the performance benefits of SSR, including reduced Time to First Contentful Paint (FCP) and improved SEO scores across various web application types and network conditions. The article further explores optimization techniques such as code splitting, caching strategies, and streaming SSR, providing a comprehensive overview of SSR's role in creating faster, more discoverable, and user-friendly web applications.

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

Edge Caching Placement Strategy based on Evolutionary Game for Conversational Information Seeking in Edge Cloud Computing

In Internet applications, network conversation is the primary communication between the user and server. The server needs to efficiently and quickly return the corresponding service according to the conversation sent by the user to improve the users’ Quality of Service. Thus, Conversation Information Seeking (CIS) research has become a hot topic today. In Cloud Computing (CC), a central service mode, the conversation is transmitted between the user and the remote cloud over a long distance. With the explosive growth of Internet applications, network congestion, long-distance communication, and single point of failure have brought new challenges to the centralized service mode. People put forward Edge Cloud Computing (ECC) to meet the new challenges of the centralized service mode of CC. As a distributed service mode, ECC is an extension of CC. By migrating services from the remote cloud to the network edge closer to users, ECC can solve the above challenges in CC well. In ECC, people solve the problem of CIS through edge caching. The current research focuses on designing the edge cache strategy to achieve more predictable caching. In this article, we propose an edge cache placement method Evolutionary Game based Caching Placement Strategy (EG-CPS). This method consists of three modules: the user preference prediction module, the content popularity calculation module, and the cache placement decision module. To maximize the predictability of the cache strategy, we are committed to optimizing the cache hit rate and service latency. The simulation experiment compares the proposed strategy with several other cache strategies. The experimental results illustrate that EG-CPS can reduce up to 2.4% of the original average content request latency, increase the average direct cache hit rate by 1.7%, and increase the average edge cache hit rate by 3.3%.

An on-demand collaborative edge caching strategy for edge–fog–cloud environment

In this paper, we tackle the critical challenges of content edge caching, such as limited storage capacity, content popularity prediction, dynamic user demand, and user privacy, issues that most existing studies only address partially. We present an innovative Genetic Algorithm-based On-demand Collaborative Edge Caching mechanism (GAOCEC), which introduces a multi-tiered caching architecture integrating cloud, fog, and edge computing. To enhance caching efficiency and minimize system cost, a novel on-demand caching quota mechanism is proposed that dynamically allocates cache resources to edge servers. To strengthen user privacy protection during content popularity prediction, a CNN-BiLSTM-based Federated Learning algorithm (CBFL) is presented that ensures high prediction accuracy without the need to upload local data to the cloud. We also refine the genetic algorithm for content placement by fine-tuning various parameter sets to identify the optimal balance between latency reduction and caching cost. Our experimental results validate the effectiveness of our approach, demonstrating increased cache hit rates, decreased content response times, and an overall improvement in system efficiency. This work provides a comprehensive, adaptive, and privacy-preserving solution for the edge–fog–cloud environment.

Interest-aware joint caching, computing, and communication optimization for mobile VR delivery in MEC networks

In the upcoming B5G/6G era, Virtual Reality (VR) over wireless has become a typical application, which is an inevitable trend in the development of video. However, in immersive and interactive VR experiences, VR services typically exhibit high delay, while simultaneously posing challenges for the energy consumption of local devices. To address these issues, this paper aims to improve the performance of VR service in the edge-terminal cooperative system. Specifically, we formulate a joint Caching, Computing, and Communication (3C) VR service policy problem by optimizing the weighted sum of the total VR delivery delay and the energy consumption of local devices. To design the optimal VR service policy, the optimization problem is decoupled into three independent subproblems to be solved separately. To improve the caching efficiency within the network, a Bert-based user interest analysis method is first proposed to accurately characterize the content request behavior. Based on this, a service cost minimum-maximization problem is formulated under the consideration of performance fairness among users. Then, the joint caching and computing scheme is derived for each user with a given allocation of communication resources while a bisection-based communication scheme is acquired with the given information on the joint caching and computing policy. With alternative optimization, an optimal policy for joint 3C based on user interest can be finally obtained. Simulation results are presented to demonstrate the superiority of the proposed user interest-aware caching scheme and the effectiveness of the joint 3C optimization policy while considering user fairness. Our code is available at https://github.com/mrfuqaq1108/Interest-Aware-Joint-3C-Optimization.

A Stochastic Geometry-Based Cost-Efficient Caching Strategy in Device-to-Device-Enabled Multi-Layer Heterogeneous Networks

A Stochastic Geometry-Based Cost-Efficient Caching Strategy in Device-to-Device-Enabled Multi-Layer Heterogeneous Networks

Optimization model for vehicular network data queries in edge environments

As the Internet of Vehicles advances, the demand for timely data acquisition by vehicle users continues to escalate, albeit confronted with the challenge of excessive data retrieval latency. The emergence of edge computing provides technical support for the development of vehicular networks by caching data in advance to reduce data acquisition latency. Therefore, how to effectively cache and query data becomes a key issue in addressing the timeliness of data acquisition in vehicular networks. In this paper, we investigate an efficient query optimization model to minimize data acquisition latency. Firstly, based on the distribution of data query frequencies across different servers, we propose an edge collaborative caching strategy using a tabu search algorithm. This strategy prioritizes high-traffic data by finding two optimal storage nodes for each high-traffic data in descending order of data popularity, ensuring a backup within the collaborative domain for each data segment. This not only reduces data transmission latency between nodes during task execution but also prevents single-point failures. Secondly, we deploy cuckoo filters on edge nodes to enable rapid localization of cached data nodes when users query data, thus reducing data processing latency. Finally, simulation results demonstrate that the proposed query optimization model outperforms other schemes in terms of average data query latency.

DeCa360: Deadline-aware edge caching for two-tier 360° video streaming

Two-tier 360° video streaming provides a robust solution for handling inaccurate viewport prediction and varying network conditions. Within this paradigm, the client employs a dual-buffer mechanism consisting of a long buffer for panoramic basic-quality segments and a short buffer for high-quality tiles. However, designing an efficient edge caching strategy for two-tier 360° videos is non-trivial. First, as basic-quality segments and high-quality tiles possess different delivery deadlines as well as content popularity, ignoring these discrepancies may result in inefficient edge caching. Second, accurately predicting the popularity of 360° videos at a fine granularity of video segments and tiles remains a challenge. To address these issues, we present DeCa360, a deadline-aware edge caching framework for 360° videos. Specifically, we introduce a lightweight runtime cache partitioning approach to achieve a careful balance between improving the cache hit ratio and guaranteeing more on-time delivery of objects. Moreover, we design a content popularity prediction method for two-tier 360° videos that combines a learning-based prediction model with domain knowledge of video streaming, leading to improved prediction accuracy and efficient cache replacement. Extensive experimental evaluations demonstrate that DeCa360 outperforms all baseline algorithms in terms of byte-hit ratio and on-time delivery ratio, making it a promising approach for efficient edge caching of 360° videos.

Low-latency intelligent service combination caching strategy with density peak clustering algorithm in vehicle edge computing

In the dynamic field of Vehicle Edge Computing (VEC), the demand for intelligent vehicular systems to process vast amounts of data is escalating, driven by advancements in autonomous driving and real-time navigation technologies. Optimizing service latency and minimizing transmission costs are crucial for enhancing the performance of vehicular networks. Traditional service caching strategies, which largely rely on the popularity of individual services, often fail to account for the intricate interdependencies between services. The oversight can result in redundant data transfers and inefficient use of storage resources. In response, our paper introduces a novel approach to service combination caching within a heterogeneous computational framework comprising vehicles, edge servers, and the cloud. Our strategy focuses on minimizing user wait times and data transmission costs during task execution, while adhering to the caching budget constraints of service providers. Key contributions include the development of an Improved Density Peak Clustering (IDPC) algorithm to facilitate cooperative clustering among edge servers and the design of a Service Combination Caching Strategy (SCCS). The SCCS approach reduces caching costs by categorizing servers, forming efficient clusters, and strategically allocating storage. Simulation results demonstrate that the method outperforms existing strategies by significantly decreasing task execution delays and transmission costs, thereby greatly enhancing the quality of service in vehicular applications.

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.

Learning-based joint recommendation, caching, and transmission optimization for cooperative edge video caching in Internet of Vehicles

In an era dominated by multimedia information, achieving efficient video transmission in the Internet of Vehicles (IoV) is crucial because of the inherent bandwidth constraints and network volatility within vehicular environments. In this paper, we propose a cooperative edge video caching framework designed to enhance video delivery efficiency in IoV by integrating joint recommendation, caching, and transmission optimization. Leveraging deep reinforcement learning with the discrete soft actor–critic algorithm, our methodology dynamically adapts to fluctuating network conditions and diverse user preferences, aiming to optimize content delivery efficiency and quality of experience. The proposed approach combines recommendation and caching strategies with transmission optimization to provide a comprehensive solution for high-performance video services. Extensive simulation results demonstrate that our framework significantly outperforms traditional baseline methods, achieving superior outcomes in terms of service utility, delivery rate, and delay reduction. These results highlight the robust potential of our solution to facilitate seamless and high-quality video experiences in the complex and dynamic landscape of vehicular networks, advancing the capabilities of IoV content delivery.

Cooperative edge-caching based transmission with minimum effective delay in heterogeneous cellular networks

In heterogeneous cellular networks (HCNs), neighboring users often request similar contents asynchronously. Based on the content popularity, base stations (BSs) can download and cache contents when the network is idle, and transmit them locally when the network is busy, which can effectively reduce the backhaul burden and the transmission delay. We consider a two-tier HCN, where macro base stations (MBSs) and small base stations (SBSs) can cooperatively and probabilistically cache contents. Each user is associated to the BS with the maximum average received signal power in any tier. With the cooperative content transfer between MBS tier and SBS tier, users can adaptively obtain contents from BSs or remote content servers. We properly model both wired and wireless delays when a user requests an arbitrary content, and propose the concept of effective delay. Content caching probabilities are optimized using the Marine Predators Algorithm via minimizing the average effective delay. Numerical results show that our proposed cooperative caching scheme achieves much shorter delays than the benchmark caching schemes.

Adaptive Caching Strategies for IoV Based on LTE Signal Quality Analysis

The Internet of Vehicles (IoV) enhances vehicular communication, promising better connectivity and user experiences. However, maintaining stable data delivery in dynamic vehicular environments is challenging. This paper introduces Mob-Cach, a novel mobility-aware cache management strategy that leverages real-time vehicular mobility information. Our preliminary study on LTE signal quality shows that mobility patterns significantly impact signal degradation. Based on these findings, we developed a dynamic caching framework that adapts to real-time mobility data, optimizing content delivery and network performance. Simulations demonstrate significant improvements in cache hit rates, reduced latency, and overall network efficiency. This research lays a foundation for future advancements in IoV networks, addressing the challenges of mobile and dynamic network topologies.

Walkin’ Robin: Walk on Stars with Robin Boundary Conditions

Numerous scientific and engineering applications require solutions to boundary value problems (BVPs) involving elliptic partial differential equations, such as the Laplace or Poisson equations, on geometrically intricate domains. We develop a Monte Carlo method for solving such BVPs with arbitrary first-order linear boundary conditions---Dirichlet, Neumann, and Robin. Our method directly generalizes the walk on stars (WoSt) algorithm, which previously tackled only the first two types of boundary conditions, with a few simple modifications. Unlike conventional numerical methods, WoSt does not need finite element meshing or global solves. Similar to Monte Carlo rendering, it instead computes pointwise solution estimates by simulating random walks along star-shaped regions inside the BVP domain, using efficient ray-intersection and distance queries. To ensure WoSt produces bounded-variance estimates in the presence of Robin boundary conditions, we show that it is sufficient to modify how WoSt selects the size of these star-shaped regions. Our generalized WoSt algorithm reduces estimation error by orders of magnitude relative to alternative grid-free methods such as the walk on boundary algorithm. We also develop bidirectional and boundary value caching strategies to further reduce estimation error. Our algorithm is trivial to parallelize, scales sublinearly with increasing geometric detail, and enables progressive and view-dependent evaluation.

Implementation and optimization of SpMV algorithm based on SW26010P many-core processor and stored in BCSR format

The irregular distribution of non-zero elements of large-scale sparse matrix leads to low data access efficiency caused by the unique architecture of the Sunway many-core processor, which brings great challenges to the efficient implementation of sparse matrix–vector multiplication (SpMV) computing by SW26010P many-core processor. To address this problem, a study of SpMV optimization strategies is carried out based on the SW26010P many-core processor. Firstly, we design a memorized data storage transformation strategy to transform the matrix in CSR storage format into BCSR (Block Compressed Sparse Row) storage. Secondly, the dynamic task scheduling method is introduced to the algorithm to realize the load balance between slave cores. Thirdly, the LDM memory is refined and designed, and the slave core dual cache strategy is optimized to further improve the performance. Finally, we selected a large number of representative sparse matrices from the Matrix Market for testing. The results show that the scheme has obviously speedup the processing procedure of sparse matrices with various sizes and sizes, and the master–slave speedup ratio can reach up to 38 times. The optimization method used in this paper has implications for other complex applications of the SW26010P many-core processor.

Multiagent Federated Deep-Reinforcement-Learning-Based Collaborative Caching Strategy for Vehicular Edge Networks

Multiagent Federated Deep-Reinforcement-Learning-Based Collaborative Caching Strategy for Vehicular Edge Networks

RMBCC: A Replica Migration-Based Cooperative Caching Scheme for Information-Centric Networks

How to maximize the advantages of in-network caching under limited cache space has always been a key issue in information-centric networking (ICN). Replica placement strategies aim to fully utilize cache resources by optimizing the location and quantity distribution of replicas in the network, thereby improving the performance of the cache system. However, existing research primarily focuses on optimizing the placement of replicas along the content delivery path, which cannot avoid the inherent drawback of not being able to leverage off-path cache resources. The proposals for off-path caching cannot effectively solve this problem as they introduce excessive complexity and cooperation costs. In this paper, we address the trade-off between cache resource utilization and cooperation costs by introducing a mechanism complementary to replica placement. Instead of redesigning a new caching strategy from scratch, we propose a proactive cooperative caching mechanism (called RMBCC) that involves an independent replica migration process, through which we proactively relocate replicas evicted from the local cache to neighboring nodes with sufficient cache resources. The cooperation costs are effectively controlled through migration replica filtering, migration distance limitation, as well as hop-by-hop migration request propagation. Extensive simulation experiments show that RMBCC can be efficiently integrated with different on-path caching strategies. Compared with representative caching schemes, RMBCC achieves significant improvements in evaluation metrics such as cache hit ratio and content retrieval time, while only introducing negligible cooperation overhead.

Efficient Heuristic Management of Cloud Data Lakes for Enhanced Big Data Handling in Cloud Computing Environments

Efficient control of cloud data lakes is important for improving big data dealing in cloud computing settings. Cloud data lakes serve as stores for vast amounts of organized, semi-structured, and unstructured data from varied sources, offering scaling and freedom in data storage and processing. However, the sheer amount and range of data offer difficulties in improving storage, access, and analysis processes. This study suggests a heuristic method to handle these issues by improving the order and recovery of data within cloud data lakes. The heuristic method focuses on automatically handling data splitting, storage, and caching strategies based on data access trends and task factors. By leveraging heuristic principles, such as adaptable splitting and predictive caching, the suggested method aims to reduce delay and improve total query speed. Key components of the heuristic management include adaptable splitting methods that actively change data partition sizes based on access frequency and data distribution patterns. This flexible method ensures that frequently accessed data is easily available, while less accessed data is efficiently saved to improve storage usage. Furthermore, predictive storing methods expect future data access patterns using machine learning models or previous data trends. By strategically saving relevant datasets in memory or high-speed storage, the system reduces delay for repeated questions, thereby improving real-time data processing capabilities. The success of the suggested heuristic management method is tested through models and benchmarks using real big data tasks. Comparative research against standard static splitting and caching methods shows significant changes in query response times and resource utilization efficiency.

Research on the Architectural Design and Performance Optimization of Large Scale Real-Time Chat Systems

With the rapid development of internet technology, large-scale real-time chat systems have become an essential tool for connecting users worldwide. These systems not only support the core functions of social communication but also serve as key platforms for business, education, and remote collaboration. However, the surge in user numbers and the explosive growth in message volume pose unprecedented technical challenges to real-time chat systems, including high concurrency processing, low latency communication, data consistency assurance, and system scalability. This study aims to explore and implement an efficient, stable, and scalable architecture for large-scale real-time chat systems and propose corresponding performance optimization strategies. The research employs literature review, system analysis, prototype design, and performance evaluation methods. It first analyzes the design limitations and performance bottlenecks of existing real-time chat systems. Based on this analysis, a microservices-based system design scheme is proposed, which enhances system performance and reliability through componentized services, message queues, load balancing, and caching mechanisms. In terms of performance optimization, this paper focuses on key technologies such as load balancing algorithms, asynchronous processing mechanisms of message queues, caching strategies, and data storage optimization. Experimental evaluations have confirmed the significant effects of the proposed scheme in handling high-concurrency requests, reducing system latency, and improving data throughput.