Latency For Applications Research Articles

Aion: Live Migration for In-Memory Databases with Zero Downtime and Reduced Redundant Data Transfer

Abstract Distributed in-memory databases are widely adopted to achieve low latency and high bandwidth for data-intensive applications. They support scale-out by sharding and distributing data across multiple nodes. To efficiently adapt to various workloads, distributed in-memory databases must be capable of migrating shards across nodes. In this paper, we demonstrate that state-of-the-art approaches experience significant performance degradation during migration due to service downtime and redundant data transfer. Furthermore, our findings indicate that the presence of service downtime constrains the scalability of migration strategies, while the transfer of redundant data during the snapshot transfer phase limits their adaptability to dynamic workloads. To this end, this paper proposes Aion, a live migration strategy designed for distributed in-memory databases. Aion eliminates any potential service downtime by immediately switching transaction routing to the destination node. To ensure data consistency between the source and destination nodes, as well as serializable execution during migration, Aion proposes the mutual validation phase. Moreover, Aion introduces an analysis phase before the snapshot transfer phase to identify dynamically changing hotspots in workloads. The analysis phase identifies and transfers tuples and versions accessed less frequently to the destination node, reducing the amount of data transferred. Aion is implemented on a distributed in-memory database and evaluated using various OLTP workloads. The results demonstrate that Aion can fundamentally eliminate service downtime, adapt effectively to various workloads and exhibit robust scalability. Compared to state-of-the-art approaches, Aion achieves up to 2.25x–6.57x higher throughput during migration and shortens the migration duration by 53.7–68.2%.

RWA-BFT: Reputation-Weighted Asynchronous BFT for Large-Scale IoT

This paper introduces RWA-BFT, a reputation-weighted asynchronous Byzantine Fault Tolerance (BFT) consensus algorithm designed to address the scalability and performance challenges of blockchain systems in large-scale IoT scenarios. Traditional centralized IoT architectures often face issues such as single points of failure and insufficient reliability, while blockchain, with its decentralized and tamper-resistant properties, offers a promising solution. However, existing blockchain consensus mechanisms struggle to meet the high throughput, low latency, and scalability demands of IoT applications. To address these limitations, RWA-BFT adopts a two-layer blockchain architecture; the first layer leverages reputation-based filtering to reduce computational complexity by excluding low-reputation nodes, while the second layer employs an asynchronous consensus mechanism to ensure efficient and secure communication among high-reputation nodes, even under network delays. This dual-layer design significantly improves performance, achieving higher throughput, lower latency, and enhanced scalability, while maintaining strong fault tolerance even in the presence of a substantial proportion of malicious nodes. Experimental results demonstrate that RWA-BFT outperforms HB-BFT and PBFT algorithms, making it a scalable and secure blockchain solution for decentralized IoT applications.

Исследование способов диспетчеризации видео на множестве конечных устройств в контексте языка программирования Rust

Abstract. The modern world is actively moving towards digitalization, which requires efficient distribution of video content on a variety of end devices. The problem is that different usage scenarios impose different requirements on security, quality, and latency when transmitting video. The aim of the study is to identify the most suitable protocols for video dispatching in educational and real-world applications using the Rust programming language, known for its security and performance. Protocols such as HTTPS (TCP), BitTorrent, HLS, WebRTC, SRT and DASH have been investigated and analyzed. The results show that HLS and DASH have advantages in adaptive streaming in a changing network environment, while SRT and WebRTC provide low latency and high reliability for applications requiring real-time operation. The practical significance of these findings is confirmed by successful integration into educational systems, which ensures stable work even with a change in workload. Discussion: in the future, it is recommended to explore the combined use of several protocols, such as HLS and SRT, to improve the overall efficiency and reliability of video data transmission, as well as integration with CDN to improve quality and reduce load.

Wavelet and VMD enhanced traffic forecasting and scheduling method for edge cloud networks

With the proliferation of Intelligent applications, more and more organizations migrate their applications from cloud to edge cloud network to reduce the latency of applications and alleviate the workload of cloud. When the network congestion occurs, network monitoring and detection system may disable, and edge cloud network will be vulnerable to be attacked. Traffic forecasting can identify the traffic patterns in advance, and dynamically allocate network resources to decrease latency of applications and avoid security risks caused by network congestion. Therefore, we propose a network scheduling framework WVNF (Wavelet VMD Based Network Flow Management) based on traffic prediction, which utilizes neural networks to forecast network traffic and deploys route strategies to optimize network scheduling. Specifically, in order to accurately forecast network traffic, we propose a neural network model, named TSWNet (Traffic Sequence Wavelet Network). TSWNet uses VMD (variational mode decomposition) to decompose time series and extract signal structure information on different time scales, and adopts wavelet transformation to extract the local and global features of the traffic sequence in the time and frequency domain. In addition, we model this traffic scheduling problem and propose a route strategy, which utilizes the result of TSWNet to find the best path. In extensive tests, TSWNet significantly outperformed existing models, reducing MSE and MAE by up to 48.8% and 27.8% respectively, demonstrating its effective traffic prediction and network scheduling capabilities.

NVM-Enhanced Machine Learning Inference in 6G Edge Computing

With the increasing popularization of smart terminals and real-time interactive applications, fast growing technical requirements push both academia and industry to look beyond 5G and conceptualize the sixth generation (6G) mobile network. Artificial intelligence (AI) with machine learning capacities at the edge is one crucial component of a 6G mobile network which makes various time-sensitive and high-stake services possible, e.g., smart security, virtual reality, self-driving vehicles. However, resource constraints, especially the memory limitation of edge servers, become major obstacles to deploying machine learning services at the edge. Fortunately, the new generation of non-volatile memory (NVM) provides new affordable memory resources that can be easily attached to existing edge servers. In this paper, we propose a novel machine learning application placement scheme using the NVM technology at the edge to reduce the end-to-end latency. Specifically, the proposed NVM-enhanced placement scheme takes into consideration the latency of various machine learning applications over NVM devices and the network. The corresponding optimization problem is exceedingly challenging, i.e., NP-hard. Therefore, we developed a novel approximation algorithm with both low computational complexity and theoretical guarantees. Experiments and extensive simulations using real-world applications highlight that our scheme provides significantly lower end-to-end latency compared with existing baselines.

Edge Computing and Analytics for IoT Devices: Enhancing Real-Time Decision Making in Smart Environments

This article presents a comprehensive analysis of edge computing and analytics for Internet of Things (IoT) devices, addressing the growing need for real-time processing and reduced latency in IoT applications. We explore the evolution of IoT architectures, from cloud-centric models to edge-enabled systems, and examine the key components and data flows in edge computing environments. Through a detailed comparison of cloud and edge processing, we demonstrate significant latency reductions across various IoT scenarios, with improvements from hundreds of milliseconds to mere milliseconds. The article delves into crucial aspects of data management in edge computing, including local versus cloud processing trade-offs, data synchronization strategies, and privacy considerations. A case study of an edge analytics pipeline in a smart factory setting showcases practical implementations, revealing substantial improvements in anomaly detection speed, bandwidth utilization, and overall system efficiency. The case study achieved a 92.5% reduction in anomaly detection latency and an 85% decrease in bandwidth usage. Finally, we discuss ongoing challenges and future directions in edge computing, including scalability issues, standardization efforts, and the integration of emerging technologies such as 5G and AI accelerators. This article contributes to the growing body of knowledge on edge computing in IoT, offering insights into its transformative potential for creating more responsive and intelligent systems across diverse applications.

QM-ARC: QoS-aware Multi-tier Adaptive Cache Replacement Strategy

Distributed data-centric systems, such as Named Data Networking, utilize in-network caching to reduce application latency by buffering relevant data in high-speed memory. However, the significant increase in data traffic makes expanding memory capacity prohibitively expensive. To address this challenge, integrating technologies like non-volatile memory and high-speed solid-state drives with dynamic random-access memory can form a cost-effective multi-tier cache system. Additionally, most existing caching policies focus on categorizing data based on recency and frequency, overlooking the varying Quality-of-Service (QoS) requirements of applications and customers—a concept supported by Service Level Agreements in various service delivery models, particularly in Cloud computing. One of the most prominent algorithms in caching policy literature is the Adaptive Replacement Cache (ARC), that uses recency and frequency lists but does not account for QoS. In this paper, we propose a QoS-aware Multi-tier Adaptive Replacement Cache (QM-ARC) policy. QM-ARC extends ARC by incorporating QoS-based priorities between data applications and customers using a penalty concept borrowed from service-level management practices. QM-ARC is generic, applicable to any number of cache tiers, and can accommodate various penalty functions. Furthermore, we introduce a complementary feature for QM-ARC that employs Q-learning to dynamically adjust the sizes of the two ARC lists. Our solution, evaluated using both synthetic and real-world traces, demonstrates significant improvements in QoS compared to state-of-the-art methods by better considering priority levels. Results show that QM-ARC reduces penalties by up to 45% and increases the hit rate for high priority data by up to 84%, without negatively impacting the overall hit rate, which also increases by up to 61%.

Development of a Machine Learning Framework for Real-Time PMI (Post-Mortem Interval) Estimation in Field Forensics

Accurate estimation of the Post-Mortem Interval (PMI) is critical in forensic investigations, aiding in determining the time of death. However, traditional PMI estimation methods, often reliant on physiological observations and environmental factors, face significant limitations in accuracy and efficiency, especially in field conditions. This paper presents the development of a machine learning (ML) framework designed for real-time PMI estimation, integrating multimodal sensor data to address the challenges encountered in field forensics. Our framework utilizes environmental and physiological features, including body temperature, ambient humidity, and biochemical decomposition markers, to predict PMI with high precision. The ML model, trained on historical forensic data, is deployed on a real-time processing platform, enabling rapid analysis and decision-making in resource- constrained environments. The system is optimized for field operations, incorporating low-power hardware and edge computing capabilities to provide forensic investigators with reliable PMI estimates on-site. Through a series of controlled experiments simulating forensic scenarios, our framework demonstrates a significant improvement in PMI accuracy compared to traditional methods, while maintaining low latency for real-time applications. This research highlights the potential of machine learning to revolutionize forensic practices, offering a scalable and adaptive solution for time-sensitive investigations. Here are some relevant keywords for the development of a machine learning framework for real-time PMI (Post- Mortem Interval) estimation in field forensics: Keywords: Field Forensics, Real-Time Machine Learning, Body Decomposition Stages, Machine Learning in Forensic Science, Artificial Intelligence for PMI Analysis, Sensor Data in PMI Estimation, Deep Learning for PMI Estimation, Automated Forensic Analysis, Data Acquisition in Field Forensics.

Resource Allocation Based on Task Priority and Resource Consumption in Edge Computing

The computational power of Internet of Things (IoT) devices is usually low, which makes it necessary to process data and extract relevant information on devices with higher processing capacity. Edge Computing emerged as a complementary solution to cloud computing, providing devices at the network edge with computational resources to handle the data processing and analysis that constrained IoT devices eventually cannot perform. This solution allows data processing closer to the IoT devices, reducing latency for IoT applications. However, the resource constraints of edge nodes, which have lower computational power than the cloud nodes, make resource allocation and processing massive requests challenging. This study proposes an edge resource allocation mechanism based on task priority and machine learning. The proposed approach efficiently allocates resources for IoT requests based on their task priorities while monitoring the resource consumption of edge nodes. This study evaluates the performance of different classification algorithms by using well-known metrics for classifying models. The most efficient classifier achieved an accuracy of 92% and a precision of 90%. The results indicate good performance when using this classifier in the evaluated approach. The proposed mechanism demonstrated that resource management can be done more efficiently with significantly lower resource utilization when compared to an allocation method based only on distance. The study tested different scenarios regarding the number of requests, edge nodes, and a proposed failure mechanism to schedule failed node tasks to functional nodes. This failure control mechanism is a significant contribution of the proposal. Therefore, the proposed method in this study can become a valuable tool for efficient resource management with reduced computational cost and efficient resource allocation.

Joint computation offloading and resource allocation for end-edge collaboration in internet of vehicles via multi-agent reinforcement learning

Vehicular edge computing (VEC), a promising paradigm for the development of emerging intelligent transportation systems, can provide lower service latency for vehicular applications. However, it is still a challenge to fulfill the requirements of such applications with stringent latency requirements in the VEC system with limited resources. In addition, existing methods focus on handling the offloading task in a certain time slot with statically allocated resources, but ignore the heterogeneous tasks’ different resource requirements, resulting in resource wastage. To solve the real-time task offloading and heterogeneous resource allocation problem in VEC system, we propose a decentralized solution based on the attention mechanism and recurrent neural networks (RNN) with a multi-agent distributed deep deterministic policy gradient (AR-MAD4PG). First, to address the partial observability of agents, we construct a shared agent graph and propose a periodic communication mechanism that enables edge nodes to aggregate information from other edge nodes. Second, to help agents better understand the current system state, we design an RNN-based feature extraction network to capture the historical state and resource allocation information of the VEC system. Thirdly, to tackle the challenges of excessive joint observation-action space and ineffective information interference, we adopt the multi-head attention mechanism to compress the dimension of the observation-action space of agents. Finally, we build a simulation model based on the actual vehicle trajectories, and the experimental results show that our proposed method outperforms the existing approaches.

Architecture and iot security systems based on fog computing

The subject of the study is is the security architecture of the Internet of Things (IoT) based on fog computing, which allows providing efficient and secure services for many IoT users. The goal is to investigate the security architecture for IoT systems based on fog computing. To achieve the goal, the following tasks were solved: the concept of fog computing is proposed, its architecture is considered and a comparative analysis of fog and cloud computing architectures is made; the principles of designing and implementing the architecture of a fog computing system are outlined; multi-level security measures based on fog computing are investigated; and the areas of use of fog computing-based Internet of Things networks are described. When performing the tasks, such research methods were used as: theoretical analysis of literature sources; analysis of the principles of designing and implementing the security architecture of the Internet of Things; analysis of security measures at different levels of the architecture. The following results were obtained: the architecture of fog computing is considered and compared with the cloud architecture; the principles of designing and implementing the architecture of fog computing systems are formulated; multi-level IoT security measures based on fog computing are proposed. Conclusions: research on IoT security systems based on fog computing has important theoretical implications. The fog computing architecture, in contrast to the cloud architecture, better meets the demand for high traffic and low latency of mobile applications, providing more advantages for systems that require real-time information processing. When designing and implementing the architecture of fog computing systems, the factors of memory capacity, latency, and utility should be taken into account to effectively integrate fog technologies with IoT. To ensure a high level of system security, multi-level security measures should be implemented using both software and hardware solutions.

Fiber-optics IoT healthcare system based on deep reinforcement learning combinatorial constraint scheduling for hybrid telemedicine applications

Telemedicine is an emerging development in the healthcare domain, where the Internet of Things (IoT) fiber optics technology assists telemedicine applications to improve overall digital healthcare performances for society. Telemedicine applications are bowel disease monitoring based on fiber optics laser endoscopy, gastrointestinal disease fiber optics lights, remote doctor-patient communication, and remote surgeries. However, many existing systems are not effective and their approaches based on deep reinforcement learning have not obtained optimal results. This paper presents the fiber optics IoT healthcare system based on deep reinforcement learning combinatorial constraint scheduling for hybrid telemedicine applications. In the proposed system, we propose the adaptive security deep q-learning network (ASDQN) algorithm methodology to execute all telemedicine applications under their given quality of services (deadline, latency, security, and resources) constraints. For the problem solution, we have exploited different fiber optics endoscopy datasets with images, video, and numeric data for telemedicine applications. The objective is to minimize the overall latency of telemedicine applications (e.g., local, communication, and edge nodes) and maximize the overall rewards during offloading and scheduling on different nodes. The simulation results show that ASDQN outperforms all telemedicine applications with their QoS and objectives compared to existing state action reward state (SARSA) and deep q-learning network (DQN) policy during execution and scheduling on different nodes.

Orchestrating scheduling, grouping and parallelism to enhance the performance of distributed stream computing system

In a big data stream computing environment, the arrival rate of data streams usually fluctuates over time, posing a great challenge to the elasticity of system. The performance of stream computing system is crucial, especially when dealing with unbounded and fluctuating data streams. Most prior studies have primarily focused on one or two aspects to enable elasticity, often lacking prompt and comprehensive performance optimization. This limitation could lead to a tuning bottleneck, preventing the system’s performance from consistently reaching its optimal state. Additionally, many stream computing systems are not intelligently adaptive in real time due to the challenges of manual parameter reconfiguration for fluctuating streams. To better address these issues, we propose a framework named Sgp-Stream, which orchestrates scheduling, grouping and parallelism (Sgp). To enhance the system performance. We conduct the following research: (1) Running experiments to evaluate the impact of different factors such as scheduling, grouping and parallelism on system performance. Results show that factors at a single level usually have an upper limit on tuning system performance, and better overall performance can be achieved by coordinating multi-level factors. (2) Establishing quantitative models for stream application that consider computational cost and communication cost, multi-dimensional featured data stream, data center resources, and latency & throughput performance. (3) Demonstrating the effectiveness of the proposed runtime-aware data stream grouping based on smooth weighted polling, elastic adaptive scheduling based on Linear Deterministic Greedy and elastic scaling strategy based on Gradient Descent in Sgp-Stream, for continuous performance optimization.(4) Evaluating the application latency, throughput and resource utilization objectives using a real-world elastic stream computing system and twitter data set. Experimental results show that, compared to existing state-of-the-art works, the proposed Sgp-Stream outperforms them by reducing latency by 26%–48%, improving throughput by 14%–20%, and increasing resource utilization rate by 15%–21%, especially under increasing data stream input rates.

Reinforcement Learning-Driven Decision-Making for Live Virtual Machine Migration in Fog Computing

Virtualization is an essential mechanism in fog computing that enables elasticity and isolation, which in turn helps achieve resource efficiency. To bring high flexibility in a fog environment, migration of virtual machines from one node to another is required. This can be achieved by live virtual machine migration to reduce downtime and delays. Multiple existing studies have discussed live virtual machine migration in a fog environment. However, these studies have some limitations, such as pre-migrating the virtual machines based on mobility prediction only or based on the load only, which causes an issue of late and early handover. Due to the dynamic nature of fog environments, VM migration decisions require consideration of multiple factors. Hence, there is a need to develop a system that considers multiple factors to decide to migrate a virtual machine or not to solve the issue of early and late handover. This study proposes a novel approach to live virtual machine migration that applies reinforcement learning for decision-making. Experiments show that the proposed approach significantly reduces the latency of time-critical applications. The proposed system, outperforms the existing systems in terms of total average reward. The system outperformed the mobility-only-based system by 97% when tested with two fog nodes and by 80% when tested with sixteen fog nodes in terms of average reward. Further, the proposed system outperforms the load-based system by 50% and 75% when the environment consists of two fog nodes and sixteen fog nodes, respectively. This proved that considering multiple factors in deciding virtual machine migration in a fog environment can be effectively applied in time-critical applications to reduce latency.

Optimizing the performance of OpenFlow Protocol over QUIC

In the last decade, Software-defined networking (SDN) has been an eye-catching network architecture. As the essential protocol of SDN, OpenFlow provides the ability to control switches forwarding plane by the remote controller. Currently, OpenFlow protocol is mostly implemented based on TCP. However, due to the limitations of the TCP protocol (e.g., head-of-line blocking), OpenFlow suffers various problems in practical networks, such as performance degradation and increasing network overhead. This paper investigates these issues through experiments and introduces QUIC to handle these issues. Moreover, a scheduling algorithm, called Extended Performance Modular (EPM), is also proposed to further optimize the performance of OpenFlow protocol with QUIC. By considering both message properties and network conditions, EPM effectively utilizes multiple streams of QUIC to avoid head-of-line blocking and improves the efficiency of OpenFlow. The proposed OpenFlow-QUIC with EPM scheme has been implemented and evaluated on both RYU and Open vSwitch (OVS), and the code has been open-sourced. Extensive experiment results show that, compared to traditional OpenFlow, the proposed scheme can reduce applications latency over OpenFlow by 39.3%, while saving 51.6% network overhead on average.

Priority-based resource allocation in layering LoRaWAN

Abstract Network applications for the Internet of Things (IoT) frequently use Long-Range (LoRa) technology. It allows tiny wireless devices to transmit data at low volumes. The idea behind LoRa networks, or Low-Power Wide Area Networks (LPWAN), is to use airborne data transmission from sensors with a transmission range of no more than 10 km. These sensors run on batteries and should not be connected to the electrical grid. Because of the benefits of Long-Range Wide Area Network (LoRaWAN) private networks, users have implemented various services in a single LoRaWAN system to realize a range of intelligent applications. LoRaWAN faces difficulties with multiservice coexistence as the number of applications grows because of insufficient channel resources, disorganized network configuration, and scalability problems. Creating a sensible plan for allocating resources is the best course of action. Nevertheless, current methods are inapplicable to LoRaWAN systems that support several services with varying criticalities. To coordinate multiservice networks, we therefore suggest a priority-based spreading factor (SF) allocation delay monitoring layered (DML) resource allocation scheme. The three primary categories of LoRaWAN application services—monitoring, control, and safety—are outlined in this paper. The suggested prioirty based resource allocation (PB-RA) scheme distributes SFs to end devices according to the highest priority parameter, taking into account the varying criticalities of these services. This increases throughput, lowers energy consumption, and increases packet delivery rate (PDR). The main advantage associated with using it is that priority is given to applications that require safety without introducing latency in other applications.

An artificial intelligence strategy for the deployment of future microservice-based applications in 6G networks

Future applications to be supported by 6G networks are envisaged to be realized by loosely-coupled and independent microservices. In order to achieve an optimal deployment of applications, smart resource management strategies will be required, working in a cost-effective and resource-efficient manner. Current cloud computing services are challenged to meet the explosive growth and demand of future use cases such as virtual/augmented/mixed reality (VR/AR/MR). The purpose of edge computing (EC) is to better address latency and transmission requirements of those future stringent applications. However, a high flexibility and a rapid decision-making will be required since EC suffers from limited resources availability. For this reason, this work proposes an artificial intelligence (AI) technique, based on reinforcement learning (RL), to make intelligent decisions on the optimal tier and edge-site selection to serve any request according to the application’s category, constraints, and conflicting costs. In addition, when deployed at the edge-network, a heuristic has been proposed for the mapping of microservices within the selected edge-site. That heuristic will exploit a ranking methodology based on the network topology and available network and compute resources while preserving the revenue of the mobile network operator (MNO). Simulation results show that the performance of the proposed RL approach is close to the optimal solution by reaching the cost minimization objective within a 8.3% margin; moreover, RL outperforms considered benchmark algorithms in most of the conducted experiments.

Performance Optimization Across the Edge-Cloud Continuum: A Multi-agent Rollout Approach for Cloud-Native Application Workload Placement

The advancements in virtualization technologies and distributed computing infrastructures have sparked the development of cloud-native applications. This is grounded in the breakdown of a monolithic application into smaller, loosely connected components, often referred to as microservices, enabling enhancements in the application’s performance, flexibility, and resilience, along with better resource utilization. When optimizing the performance of cloud-native applications, specific demands arise in terms of application latency and communication delays between microservices that are not taken into consideration by generic orchestration algorithms. In this work, we propose mechanisms for automating the allocation of computing resources to optimize the service delivery of cloud-native applications over the edge-cloud continuum. We initially introduce the problem’s Mixed Integer Linear Programming (MILP) formulation. Given the potentially overwhelming execution time for real-sized problems, we propose a greedy algorithm, which allocates resources sequentially in a best-fit manner. To further improve the performance, we introduce a multi-agent rollout mechanism that evaluates the immediate effect of decisions but also leverages the underlying greedy heuristic to simulate the decisions anticipated from other agents, encapsulating this in a Reinforcement Learning framework. This approach allows us to effectively manage the performance–execution time trade-off and enhance performance by controlling the exploration of the Rollout mechanism. This flexibility ensures that the system remains adaptive to varied scenarios, making the most of the available computational resources while still ensuring high-quality decisions.

WeBridge: Synthesizing Stored Procedures for Large-Scale Real-World Web Applications

Modern web applications use databases to store their data. When processing user requests, these applications retrieve and store data in the database server, which incurs network round trips. These round trips significantly increase the application's latency. Previous approaches have attempted to reduce these round trips by prefetching query results or batching database accesses. However, neither method can efficiently reduce the latency when some queries depend on previous queries' results. In real-world applications, nearly 50% of the queries depend on the result of other queries. This paper presents WeBridge, the first system capable of synthesizing stored procedures for large-scale real-world web applications. First, WeBridge employs concolic execution technique to analyze the applications and generate stored procedures for hot program paths. Then, it seamlessly integrates the stored procedures into the application by extending the database access library. Finally, it improves the efficiency of the stored procedures with speculative execution. Evaluation using real-world web applications and workloads show that WeBridge achieves up to 79.8% median latency reduction and up to 2× peak throughput.

Edge collaborative caching solution based on improved NSGA II algorithm in Internet of Vehicles

With the rapid development of the Internet of Vehicles technology and the continuous advancement of intelligent transportation, vehicle network traffic is growing exponentially. Traditional caching solutions transmit content through the core network, causing significant latency. A vehicle-cloud collaborative edge caching network architecture was proposed to address this type of problem. Using this architecture, both the on-board terminals and cloud/edge servers could provide computing services. A communication model, caching model, latency model, energy consumption model, load model and multi-objective optimization problem model were designed. The edge collaborative caching solution based on the improved NSGA II algorithm was proposed. By caching some services to edge nodes and nearby vehicles, reducing content access latency and improving resource utilization. The results indicate that the caching solution outperforms the comparison scheme in terms of the comprehensive costs of latency, energy consumption, and load balancing in simulation experiments. It can meet the caching requirements of low latency and low energy consumption for in-vehicle applications, laying a solid foundation for achieving more efficient and reliable connected vehicles and autonomous driving.