Q-DDCA: Decentralized Dynamic Congestion Avoid Routing in Large-Scale Quantum Networks

• Published in: IEEE/ACM transactions on networking 2024-02, Vol.32 (1), p.1-14
• Main Authors: Chen, Lutong, Xue, Kaiping, Li, Jian, Li, Ruidong, Yu, Nenghai, Sun, Qibin, Lu, Jun
• Format: Article
• Language: English
• Subjects: Adaptive algorithms; Congestion; Entanglement distribution; fidelity; Heuristic algorithms; Networks; Nodes; Protocols; Quantum entanglement; quantum network; Quantum networks; Routing; routing algorithm; Synchronization; Topology
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/TNET.2023.3285093

The quantum network that allows users to communicate in a quantum way will be available in the foreseeable future. The network capable of distributing Bell state entangled pairs faces many challenges due to entanglement decoherence and limited network performance, especially when the network scale is enormous. Many entanglement distribution protocols have been proposed so far, and most of them are in a centralized and synchronized manner, which may be infeasible in large-scale networks. As such, in this paper, we propose a full spontaneous version of quantum networks in which the quantum nodes autonomously manage multiple entanglement distribution requests. However, one major issue is that quantum nodes have little knowledge about the network, especially the congestion (e.g., some nodes may have no usable quantum memories). We present a routing algorithm to adaptive evaluate the congestion on the neighbor nodes to avoid potential congestion. We use SimQN, the new network layer simulation platform built by our research team, to evaluate our proposed design. The result demonstrates that it can adapt to changes in network resources and reduce the drop rate that eventually leads to a higher entanglement distribution rate but remains fair for multiple requests to use the network resources fairly and achieve a more balanced throughput.