Memory-Occupied Routing Algorithms for Quantum Relay Networks

Abstract

Quantum transmission experiments have shown that the successful transmission rate of entangled quanta in optical fibers decreases exponentially. Although current quantum networks deploy quantum relays to establish long-distance connections, the increase in transmission distance and entanglement switching costs still need to be considered when selecting the next hop. However, most of the existing quantum network models prefer to consider the parameters of the physical layer, which ignore the influence factors of the network layer. In this paper, we propose a meshy quantum network model based on quantum teleportation, which considers both network layer and physical layer parameters. The proposed model can reflect the realistic transmission characteristics and morphological characteristics of the quantum relay network. Then, we study the network throughput of different routing algorithms with the same given parameters when multiple source-destination pairs are interconnected simultaneously. To solve the challenges of routing competition caused by the simultaneous transmission, we present greedy memory-occupied algorithm Q-GMOA and random memory-occupied algorithm Q-RMOA. The proposed meshy quantum network model and the memory-occupied routing algorithms can improve the utilization rate of resources and the transmission performance of the quantum network. And the evaluation results indicate that the proposed methods embrace a higher transmission rate than the previous methods with repeater occupation.