Distributed AI training often suffers from network faults. Network faults, especially at the last hop between a switch and a host, result in loss of connectivity, resulting in training job stalls and eventual failure. This is typically managed through a fail-stop mechanism, followed by a restart, incurring significant inefficiencies. We present ReCCL, the first network fault-tolerant collective communication library (CCL) that allows training progress to be preserved by seamlessly failing over to alternate paths when a network fault occurs. During failover, ReCCL keeps communication states synchronized while using dynamic channel load balancing and intra-host GPU routing to improve communication performance. Our evaluations demonstrate that ReCCL can perform failover seamlessly with minimal performance losses. Additionally, our simulations also demonstrate that failover can be effectively used to achieve significant savings in GPU hours for large-scale distributed AI training workloads.

The prevalence of computational-intensive tasks stimulate the emergence of Computing Power Networks (CPN), where Software Defined Network (SDN) is utilized for flexible control. Considering the coexistence of in-execution tasks in the network and the arrival of emergency tasks, pre-migration is essential for reserving computing resources in advance, while it results in extra transmission cost in data plane and control cost in control plane. In this paper, we propose an analytical framework of task pre-migration policy in the SDN-based CPN to reduce system cost while meeting the delay budget. Specially, we consider the delay in SDN control plane induced by pre-migration flows, which involves$\ell_{0}-\mathbf{norm}$and causes the problem non-convex and discontinuous. To overcome the challenges, we propose an iterative approximation algorithm to handle$\ell_{0}-\mathbf{norm}$constraints, which transforms the original problem into a continuous function. Then we propose a dynamic programming based algorithm to minimize the approximation error, aiming at delay guarantee. The superiority of the proposed algorithm is verified through simulations, especially for heavy task offloading.

While the average delay is traditionally an importance metric for system performance, the emerging technologies have given birth to a variety of critical applications, for which the deterministic delay guarantee is highly desired. When optimizing the average delay objective is embraced with satisfying the deterministic delay constraint, it leads to complicated coupling and brings new challenges to resource allocation. In this paper, we propose a renewal framework for multi-user power control and subband allocation to improve the comprehensive delay performance. The average delay objective is optimized under the Markov decision process (MDP) problem, while the deterministic delay constraint is satisfied through Lyapunov optimization with virtual queues. Due to the conflict of the inter-slot influence in MDP and the i.i.d. state requirement in Lyapunov approach, we exploit the recurrent property of queue states and construct a renewal system. By solving the equivalent infinite-horizon MDP in the renewal framework, we propose a resource allocation algorithm, which is proved to be asymptotically optimal. Finally, the simulation results demonstrate that the proposed scheme meets the deterministic delay constraint and achieves better average delay performance than existing baselines.

For ultra-reliable low-latency communication (URLLC), retransmission data should be scheduled with different priorities due to the urgency, which brings new challenges in delay-oriented optimization, especially with deterministic delay constraint. In this paper, we propose an adaptive modulation and coding (AMC) scheme for both initial transmissions and retransmissions in separate data queues. Different from most of the existing works focusing on average delay, we jointly consider delay performance and deterministic delay requirement by combining the Markov decision process (MDP) with Lyapunov optimization technique. To overcome the coupling in the objective and the deterministic constraint, we transform this problem into an infinite horizon MDP by constructing a renewal system with sampling. Based on this, we propose a delay-optimal modulation and coding scheme (MCS) selection policy using reinforcement learning. Simulation results show that the proposed scheme achieves better delay performance than the conventional AMC schemes.

Ultra-reliable low-latency communication (URLLC) is an indispensable element towards supporting various latency-sensitive and reliability-critical applications. To optimize the average delay while satisfying the deterministic delay constraint, initial transmission and retransmission should be handled with different priorities due to the differentiated urgency, which creates complex interdependency and brings new technical challenges to delay-oriented optimization. In this paper, we propose a retransmission-aware adaptive modulation and coding (RAMC) scheme to improve the delay performance in URLLC scenarios. Specifically, we first establish a cascaded queue system, including an initial transmission queue and a retransmission queue. The deterministic delay constraint is satisfied through Lyapunov optimization, where we transform the Lyapunov drift-plus-penalty problem into an infinite horizon Markov decision process (MDP) by constructing a renewal system with sampling to overcome the challenge brought by queue coupling. Next, we propose the delay-optimal RAMC scheme by solving the associated Bellman equation by improved reinforcement learning, which is proved to be asymptotically optimal. Finally, the superiority of the proposed RAMC scheme is verified through simulations.