The core function of quantum networks is to establish high-fidelity quantum entanglement for long-distance communication. However, the main challenge is to efficiently allocate resources under limited conditions, maximize throughput, satisfy end-to-end (E2E) fidelity requirements, and prevent quantum decoherence caused by inefficient routing algorithms. Current research focuses on optimizing either throughput or fidelity, with a lack of approaches that optimize both simultaneously; furthermore, existing algorithms suffer from high computational complexity. To tackle these challenges, this study proposes a Satisfying Fidelity Threshold Routing and Adaptive Purification Strategy (SFTRAP). SFTRAP maximizes throughput for each request by selecting multiple paths and dynamically choosing links for entanglement purification based on the current state of link resources, thus minimizing throughput loss while satisfying fidelity threshold. The strategy also adaptively adjusts the number of purification rounds according to the fidelity threshold, thereby optimizing the time required for deep purification and enhancing algorithmic efficiency. For multi-request scenarios, SFTRAP employs a priority sorting mechanism that takes into account both path cost and path freedom, which refines request scheduling and path selection to create more efficient request combinations, thus further boosting the overall network throughput. Simulation results indicate that SFTRAP surpasses state-of-the-art methods in terms of both throughput and algorithmic efficiency, highlighting its potential for optimizing resources in quantum networks.

With the rapid development of Artificial Intelligence Generated Content (AIGC), single data centers are increasingly unable to meet the growing demands for data and computational resources in distributed large-scale language model (LLM) training. In this context, distributed training across heterogeneous data centers has become a necessary choice to enhance computational power and flexibility. However, the networks in heterogeneous data centers are polymorphic, with diverse communication protocols and network architectures. This heterogeneity renders traditional routing devices ineffective in recognizing and processing gradient data. Moreover, frequent copying and excessive parsing of gradient data by routing devices across heterogeneous data centers significantly increase model training time. To address these challenges, we propose XAForward, a method for accelerating distributed LLM in heterogeneous data centers using eXpress Data Path (XDP). Specifically, XAForward introduces a polymorphic-compatible protocol that reconstructs the header of gradient data packets to enable efficient data forwarding across different communication protocols in heterogeneous data centers. Additionally, to accelerate distributed LLM computing and reduce gradient data copying and excessive parsing during training, XAForward leverages kernel-bypass techniques based on XDP for packet processing and kernel-level data forwarding using network index identifiers. Experimental results show that, compared to state-of-the-art methods, XAForward reduces the distributed LLM training time by approximately 35% to 40%.

Achieving timely and accurate snow detection on road surfaces in extreme weather conditions is vital for both transportation and computer vision applications. However, conventional object detection models, particularly those designed for small targets, fall short in addressing the challenge that is posed by special regional-level multiscale recognition task. To this end, an end-to-end precise and swift road surface snow detection architecture, termed the Resource-Saving Snow Detect Model (RSSD) that includes a multidimensional directional attention mechanism, is proposed. In this model, we designed three dedicated modules, namely Multi-dimensional Bidirectional Attention Module (MDBA), Split-EMA-Convolution (SEC) and Equal Split Convolution (ESC), to address the essential feature extraction and fusion tasks in snow detection. MDBA is able to promote lateral interaction and comprehensive feature fusion across scales, while SEC can not only enhance feature extraction for regional awareness but also reduces computational load, making it efficient under minimal computational power consumption. ESC preserves feature height fusion while significantly reducing computational costs, thereby enhancing the real-time detection capability of the model. In experimental evaluations conducted with data collected by in-vehicle cameras from various roads in the United States and Canada, the results demonstrate higher detection accuracy and speed compared to the latest Transformer-based real-time object detection methods and other exiting methods in the literature. Furthermore, we validated the model's performance and data sensitivity through semi-supervised learning with 50,000 unlabeled images. This research holds significant implications for winter road traffic and provides valuable insights for similar computer vision tasks.

In the software defined network (SDN) environment, network function virtualisation enables the virtual machine migration. Owing to the fact that transferring large amount of data will impede competing workflows, virtual network function (VNF) migration has brought a new perspective. Many optimised algorithms focusing on limiting migration time and migration cost have been proposed. In this study, the authors address the problem from a different perspective. They view the network topology from a global perspective and focus on the network effect of the whole network caused by VNF migration in the context of SDN. They introduce a parameter delay to formulate the network effect and an effect model is proposed to evaluate the migration effect of the network. In addition, a heuristic algorithm is proposed to minimise network effect while balancing network load and improving the service considering the migration cost and resources limit at the same time. The practicability and efficiency of the proposed model and algorithm are validated by simulation evaluation. By comparing their proposed algorithm with traditional benchmarks and closely related benchmarks, the experimental results show that their proposed algorithm largely reduces the network effect, while at the same time limiting the run time.