Journal of Advanced Research in Applied Sciences and Engineering Technology

Routing Design for Enhancement of Capacity Utilisation and Weighted Throughput on Quantum Networks Using Genetic Algorithm

Azali Saudi, Emilia Rosa Jimson

Published Mar 16, 2025• 0 citations

Abstract

Quantum networks facilitate communication among quantum devices, playing a crucial role in enabling applications beyond the reach of classical networks. However, creating a quantum network that supports reliable long-distance entanglement distribution remains a significant challenge. Unlike classical networks, connections in quantum networks are established through entanglement generation. Effective communication between quantum devices requires a routing strategy that efficiently manages the establishment of entanglement. In addition to fidelity, the quality of communication is also determined by the capacity of the generated entanglement. Therefore, we proposed a capacity allocation scheduling scheme based on a metaheuristic approach, namely a Genetic Algorithm (GA), to ensure efficient capacity allocation for multiple communication paths within each communication request. Simulations were conducted in four different scenarios, and the results were compared to an existing capacity allocation scheduling algorithm, Progressive Filling (PF), to verify the effectiveness of the proposed scheme. The average capacity utilisation, U and weighted throughput, F results indicate that PF outperforms GA in a scenario with four communication requests, while GA performs better in scenarios involving six, eight, and ten communication requests. Specifically, the improvement in average capacity utilisation ranges from 8% to 46%, and the improvement in weighted throughput ranges from 24% to 94%. These results suggest that GA can serve as a valuable reference for designing optimal routing and capacity allocation schemes in more complex networks with multiple communication requests.

DOI: 10.37934/araset.63.2.8296

Related papers

Parameter Tuning for Genetic Algorithm Applied to Quantum Routing with Multiple Communication Requests Across Two Different Topologies

Emilia Rosa Jimson, Azali Saudi

The quantum internet facilitates communication between quantum devices, making its development essential for advancing quantum technologies. However, realizing a fully functional quantum internet requires overcoming several challenges, including establishing efficient routing mechanisms to ensure effective communication. This study proposes a capacity allocation scheduling scheme based on a Genetic Algorithm (GA) to address the issue of non-uniform edge capacity utilization within a practical routing process. However, it is essential to note that the performance of the GA scheduling scheme is influenced by its control parameters, highlighting the need for parameter tuning. In this paper, we conducted simulations to examine how epochs and population sizes impact the GA scheduling performance, specifically in maximizing average capacity utilization and weighted throughput . The configurations were simulated under six and ten communication requests across two topology structures to assess their response to variations in problem characteristics. The simulation results were then compared with an existing capacity allocation scheduling method, Progressive Filling (PF). Our findings reveal that GA outperforms PF in all scenarios and topology structures. Additionally, we deduce that 30 epochs and a population size of 50 are adequate for optimizing average capacity utilization and weighted throughput .

Journal of Advanced Research DesignDec 31, 20240 citations

Effective routing design for remote entanglement generation on quantum networks

Changhao Li, Tianyi Li, Yi-Xiang Liu +1 more

Abstract Quantum network is a promising platform for many ground-breaking applications that lie beyond the capability of its classical counterparts. Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network’s capabilities, the solution to which calls for delicate network design and is currently at the primitive stage. In this study we propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations on a quantum lattice network with finite edge capacities. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification. The routing scheme is highly modularized with a flexible nature, embedding quantum operations within the algorithmic workflow, whose performance is evaluated from multiple perspectives. In particular, three algorithms are proposed and compared for the scheduling of capacity allocation on the edges of quantum network. Embodying the ideas of proportional share and progressive filling that have been well-studied in classical routing problems, we design another scheduling algorithm, the propagatory update method, which in certain aspects overrides the two algorithms based on classical heuristics in scheduling performances. The general solution scheme paves the road for effective design of efficient routing and flow control protocols on applicational quantum networks.

arXiv:2001.02204npj Quantum InformationJan 27, 2021133 citations

Quantum Network Routing Design with Dynamic Requests Scheduling in Multi-User Environments

Xinrui Liu, Ruidong Li

Scheduling in quantum networks involves strategically allocating quantum resources to maximize entanglement distribution efficiency and overall performance. Unlike classical networks, quantum systems lack conventional buffering mechanisms, making traditional scheduling paradigms less effective. Existing quantum network algorithms predominantly focus on routing algorithms to identify optimal entanglement paths, often neglecting timeslot scheduling for mitigating resource contention and transmission latency, particularly under multi-user environments. To address these challenges, we propose a routing algorithm tightly integrated with priority-based dynamic scheduling. The algorithm not only discovers efficient entanglement paths but also optimizes resource utilization for concurrent requests. Simulation results confirm that this approach conserves quantum resources, reduces latency, and substantially boosts network performance, providing a robust solution for multi-user quantum environments.

International Wireless Communications and Mobile Computing Conference (IWCMC)May 12, 20251 citation

Swapping-Based Entanglement Routing Design for Congestion Mitigation in Quantum Networks

Zhonghui Li, Jian Li, Kaiping Xue +5 more

The quantum network is designed to connect numerous quantum nodes and support various ground-breaking quantum applications. Most of these applications require communicating parties to share entangled pairs. Therefore, entanglement routing, a technology distributing entangled pairs between distant quantum nodes, plays a vital role in realizing quantum networks’ capability. However, due to the limitation of quantum memory size and quantum decoherence, the entangled pairs shared by adjacent quantum nodes can hardly satisfy concurrent entanglement routing requests, thus leading to severe network congestion. In this paper, we propose a novel congestion mitigation (CM) scheme to tackle such bottleneck problems. The basic idea of CM is to “recycle” idle link-level entanglement resources from well-resourced links to bottleneck links utilizing a unique enabling technology of quantum networks, called entanglement swapping. CM can increase the capacity of each bottleneck link, thus overcoming resource limitations to improve resource utilization and network throughput. To complete our work, we also propose a swapping-based entanglement routing design, including path selection and resource allocation algorithms. Extensive simulations show that our design can significantly alleviate network congestion and improve the request service rate of quantum networks compared to the traditional entanglement routing designs.

IEEE Transactions on Network and Service ManagementMay 12, 202332 citations

Efficient Routing Scheme Based on Segmentation in Quantum Networks

Naixue N. Xiong, Chanchan Kuang, Wei Liang +2 more

With the development of the Internet of Things (IoT) towards supporting next-generation security and distributed applications, the integration of quantum communication technology provides a promising way to enhance data security, computing power, and perception accuracy. The large-scale interconnection of quantum nodes enables the formation of quantum enhanced IoT networks, with high fidelity entanglement serving as the cornerstone of secure and efficient communication. However, the inherent limitations of quantum resources and channel noise pose significant challenges to routing and resource management. This article constructs the quantum path selection problem as a multi criteria path selection problem, designs a weight scoring function to obtain the optimal path in the current network for each request, and proposes a two-stage routing and allocation strategy TPROA, namely the idea of "guarantee before utilization", aiming to maximize network throughput and improve resource utilization in resource constrained network environments. The simulation results show that compared with traditional methods, TPROA significantly improves quantum resource utilization and network throughput. The proposed method lays the foundation for scalable quantum IoT integration.

IEEE Internet of Things JournalOct 6, 20252 citations

Quantum Network Multi-Path Communication Optimization

Jincheng Zhang

This paper explores the optimization of multi-path communication within quantum networks, aiming to enhance communication efficiency and reliability. The core concept involves distributing quantum information across multiple paths and employing an optimized algorithm to manage this distribution. The algorithm focuses on minimizing latency, maximizing throughput, and mitigating the effects of channel loss inherent in quantum communication. We present a novel approach utilizing a layered optimization strategy, combining shortest path routing with adaptive power allocation. Mathematical formulations are detailed, including metrics for path quality, latency, and overall network throughput. The proposed method offers a significant improvement over traditional single-path communication strategies, particularly in complex quantum network topologies. Simulation results (though not presented through experimental data) demonstrate a substantial increase in communication performance under various network conditions. Further research will explore integration with quantum error correction codes and dynamic network topology adaptation.

Sep 5, 20260 citations