The emergence of Internet of Vehicles (IoV) technology provides a wider range of application scenarios for edge computing based on Vehicle-to-everything (V2X). It is essential to ensure the high availability and reliability of services in IoV systems. Currently, cloud service providers have established a data center level of fault tolerance, such as redundancy and checkpoints, guaranteeing the reliability of cloud infrastructure and reducing phenomena such as service termination or downtime. However, current computing systems reactively handle failures. Especially in edge computing, this approach not only lacks flexibility but also consumes excessive system resources, which is not conducive to ensuring the reliability in resource-constrained systems and poses security risks to end users. To mitigate this problem, we propose a Proactive Fault-tolerance Driven Task Scheduling System. Different from the traditional reactive strategies, the proposed framework predicts the possible system crashes by monitoring the critical state indicators of the computing system. According to the prediction results, a class of tasks or services that are most likely to be terminated are rescheduled in advance. Extensive experiments are conducted, and evaluation results demonstrate that our proposed proactive fault tolerance framework can effectively improve the long-term performance of the IoV edge system.

Graph Neural Networks (GNNs) are widely used for fault diagnosis in microservice systems, but their true benefit is often conflated with that of complex preprocessing pipelines. To isolate the GNN's contribution, we propose DiagMLP, a minimal, topology-agnostic MLP baseline. We conduct an ablation study by replacing GNN modules with DiagMLP in existing state-of-the-art frameworks. Across five datasets, this simple baseline achieves performance parity with GNN-based methods in fault detection, localization, and classification. These findings challenge the assumption that GNNs are indispensable, suggesting their contribution is marginal and that performance is primarily driven by preprocessing that already encodes critical dependency information. Our work advocates for a systematic re-evaluation of model complexity and the adoption of rigorous baselines to validate future innovations.

This paper presents a comprehensive study on the asymptotically optimal repair of Reed-Solomon (RS) codes with small sub-packetization, specifically tailored for rack-aware distributed storage systems. Through the utilization of multibase expansion, we introduce a novel approach that leverages monomials to construct linear repair schemes for RS codes. Our repair schemes which adapt to all admissible parameters achieve asymptotically optimal repair bandwidth while significantly reducing the sub-packetization compared with existing schemes. Furthermore, our approach is capable of repairing RS codes with asymptotically optimal repair bandwidth under the homogeneous storage model, achieving smaller sub-packetization than existing methods.

Multi-access Edge Computing (MEC) plays an im-portant role for providing end users with high reliability and low latency services at the edge of mobile network. In the scenario of Internet of Vehicles (IoV), vehicle users continually access nearby base stations to offload real-time tasks for reducing their computing overhead, while the ongoing services on current deployed edge nodes may be far away from users with the vehicles moving, potentially resulting in a high delay of data transmission. To address this challenge, in this paper, we propose a Deep Reinforcement Learning (DRL)-based mobility-aware service migration mechanism for effectively reducing the service delay and migration delay of the network. The proposed technique is adopted by re-calibrating required services at edge locations near the mobile user. Edge network state and user movement information are considered to ensure the generation of real-time service migration decision. Extensive experiments are conducted, and evaluation results demonstrate that our proposed DRL-based technique can effectively reduce the long-term average delay of the MEC system, compared with the state-of-the-art techniques.

In centralized task allocation strategies, real-time status information needs to be collected from distributed edge nodes. Therefore, the overloaded transmission on backbone network appears and leads to devastating decrease in the per-formance of centralized strategies. To address this issue, this paper proposes a multi-agent deep reinforcement learning based online decentralized task allocation mechanism, where each edge node makes task allocation decisions based on local network-state information. A centralized-training distributed-execution method is adopted to decrease data transmission load, and a value decomposition-based technique is applied at training stage for improving long-term performance of task allocation in edge col-laborative networks. Extensive experiments are conducted, and evaluation results demonstrate that our mechanism outperforms other three baseline algorithms in reducing the long-term average system delay and improving request completion rate.

Cloud computing, which is claimed to provide plentiful storage, computational, and other resources, has become a promising platform to support resource-intensive applications. Due to the wide adoption of smart things to support domain applications and considering the delay-sensitivity of certain requests and limited network capacity compared with huge data packets to be transmitted, the quality of experience (QoE) may be hard to be satisfied when requests are solely supported by cloud computing. In this setting, edge computing has become an infrastructure to facilitate request satisfaction at the network edge. This article proposes a mechanism to optimize the collaboration of heterogeneous edge servers with certain QoE constraints. Specifically, concurrent requests, which are usually represented in terms of SQL queries, are rewritten as atomic queries, and these atomic queries are optimally assigned to edge servers through adopting an algorithm inspired by the minimum spanning tree, where QoE factors, including the delay, size of data packets, and number of operators, are considered. Evaluation results indicate that the proposed mechanism can effectively improve the QoE of requests compared with the state-of-the-art's mechanisms.

Industrial Internet of Things has been widely used to facilitate disaster monitoring applications, such as liquid leakage and toxic gas detection. Since disasters are usually harmful to the environment, detecting accurate boundary regions for continuous objects in an energy‐efficient and timely fashion is a long‐standing research challenge. This article proposes a novel mechanism for continuous object boundary region detection in a fog computing environment, where sensing holes may exist in the deployed network region. Leveraging sensory data that have been gathered, interpolation algorithms have been applied to estimate sensory data at certain geographical locations, in order to estimate a more accurate boundary line. To examine whether estimated sensory data reflect that fact, mobile sensors are adopted to traverse these locations for gathering their sensory data, and the boundary region is calibrated accordingly. Experimental evaluation shows that this technique can generate a precise object boundary region with certain time constraints, and the network lifetime can be prolonged significantly.