Quantum network routing algorithm based on Trusted Center

M. Vijay Anand, C. Jayakumar

Omar Amer, Walter O. Krawec, Md. Zakir Hossain +2 more

In this paper, we consider hybrid quantum key distribution (QKD) networks with primarily quantum repeaters and a small number of trusted nodes. While the trusted nodes need to be trusted, the use of such nodes, together with efficient routing algorithms, can significantly improve the key generation rate. We show that when trusted nodes are placed at asymmetric locations relative to Alice and Bob, however, existing routing algorithms can lead to low key rate. To address this issue, we develop dynamic routing strategies that adjust routing decisions based on the current key pool conditions in the network. In addition, we investigate new and existing classical post-processing techniques that complement the dynamic routing strategies. Using extensive simulations, we show that our dynamic routing strategies can significantly outperform static strategies, and the post-processing techniques are beneficial in high noise scenarios. In addition, combining the dynamic routing strategies and post-processing techniques can further improve the overall key rate.

Liquan Chen, Jingqi Chen, Qian-Ye Chen +1 more

William J. Munro, Nicoló Lo Piparo, Michael Hanks +1 more

Xi Chen, Gonghua Hou, Xinyi Lin +4 more

For the security requirements of high-speed and large-capacity transmission, quantum key distribution technology plays an important role in optical networks. In the process of deploying QKD networks in the future, the partially- trusted QKD network will be a more realistic scenario. To solve the QKD with an untrusted relay, MDI-QKD protocol is designed, In MDI-QKD, two QKD nodes send the quantum states to the untrusted relay and the measurement device in the untrusted relay measures the received quantum states. Based on the overall feasibility of QKD-integrated optical networks and the common tree topologies in backbone optical networks, this paper proposes a quantum key distribution method and a routing algorithm in a partially-trusted QKD tree-topology network by combining the trusted relay technology and MDI- QKD protocol and considering the quantum key pool. Simulation results show that the proposed TT-AR algorithm is effective for tree topologies.

Chao Yang, Hongqi Zhang, SU Jin-hai

Quantum key distribution (QKD) technology can establish unconditional secure keys between two communicating parties. Although this technology has some inherent constraints, such as the distance and point-to-point mode limits, building a QKD network with multiple point-to-point QKD devices can overcome these constraints. Considering the development level of current technology, the trust relaying QKD network is the first choice to build a practical QKD network. However, the previous research didn’t address a routing method on the trust relaying QKD network in detail. This paper focuses on the routing issues, builds a model of the trust relaying QKD network for easily analysing and understanding this network, and proposes a dynamical routing scheme for this network. From the viewpoint of designing a dynamical routing scheme in classical network, the proposed scheme consists of three components: a Hello protocol helping share the network topology information, a routing algorithm to select a set of suitable paths and establish the routing table and a link state update mechanism helping keep the routing table newly. Experiments and evaluation demonstrates the validity and effectiveness of the proposed routing scheme.