Cost-effective QKD protocol upgrading for metropolitan quantum optical networks

Mingxuan Guo; Yuan Cao; Jiali Zhu; Xingyu Zhou; Chunhui Zhang; Xiaosong Yu; Yongli Zhao; Jie Zhang; Qin Wang

doi:10.1364/JOCN.496154

Journal of Optical Communications and Networking
Vol. 15,
Issue 9,
pp. 700-710
(2023)
•https://doi.org/10.1364/JOCN.496154

Cost-effective QKD protocol upgrading for metropolitan quantum optical networks

Mingxuan Guo, Yuan Cao, Jiali Zhu, Xingyu Zhou, Chunhui Zhang, Xiaosong Yu, Yongli Zhao, Jie Zhang, and Qin Wang

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Mingxuan Guo, Yuan Cao, Jiali Zhu, Xingyu Zhou, Chunhui Zhang, Xiaosong Yu, Yongli Zhao, Jie Zhang, and Qin Wang, "Cost-effective QKD protocol upgrading for metropolitan quantum optical networks," J. Opt. Commun. Netw. 15, 700-710 (2023)

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Citation alert
Save article

Abstract

Quantum key distribution (QKD) is a promising technology that can provide future-proof security. With the emergence of multiple advanced QKD protocols, the QKD protocol upgrading for a metropolitan quantum optical network (MQON) is critical for fulfilling the requirements of users for secret keys with a high security level. Conventionally, due to the lack of effective QKD protocol upgrading strategies for MQONs, massive amounts of resources have to be consumed during QKD protocol upgrading, resulting in high costs. In order to reduce the costs for practical implementation of QKD protocol upgrading, in this work, a new policy of QKD protocol upgrading is proposed, where the bypass technique is adopted to decouple multiple protocols from the linking patterns for efficient resource utilization. Moreover, we illustrate a multi-role QKD node structure for enabling the harmonious operation of multiple QKD protocols. A mixed integer linear programming (MILP) model and a novel divided-packet-based QKD protocol upgrading algorithm are designed to save costs by relying on flexible traffic management. We also propose a fixed-chain-based QKD protocol upgrading algorithm with fixed traffic management for achieving low costs. Simulation results indicate that the proposed heuristic algorithms are significantly more cost effective than the associated benchmark algorithms, while the MILP model can reduce the cost of protocol upgrading by 41% compared with the benchmark.

Full Article | PDF Article

More Like This

Cost-Efficient Quantum Key Distribution (QKD) Over WDM Networks

Yuan Cao, Yongli Zhao, Jianquan Wang, Xiaosong Yu, Zhangchao Ma, and Jie Zhang
J. Opt. Commun. Netw. 11(6) 285-298 (2019)

Noise-aware resource allocation with integrated key generation and consumption for CV-QKD over WDM networks

Shifeng Ding, Gangxiang Shen, Fengxian Tang, and Calvin Chun-Kit Chan
J. Opt. Commun. Netw. 16(1) 29-44 (2024)

Auxiliary graph based routing, wavelength, and time-slot assignment in metro quantum optical networks with a novel node structure

Kai Dong, Yongli Zhao, Xiaosong Yu, Avishek Nag, and Jie Zhang
Opt. Express 28(5) 5936-5952 (2020)

Previous Article Next Article

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (9)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (3)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (15)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Notation	Definition
$G (V, E)$	MQON topology
$V$	Set of nodes on the MQON topology
$E$	Set of links on the MQON topology
$K_{o}$	Set of original QKD key rates on each link
$K_{n}$	Set of new QKD key rates on each link
$R_{o}$	Set of original QKD services (implementing a single QKD protocol)
$R_{n}$	Set of protocol upgrading requests
$R_{s}$	Set of successful protocol upgrading requests
$T_{o}$	Set of time resources required for the original protocol per unit of time on each link
$T_{a}$	Set of time resources required for the new protocol per unit of time on each link
$C_{o}$	Set of the number of channels already on link ( $m, n$ )
$C_{a}$	Set of the number of channels added on link ( $m, n$ )
$m, n$	Indices of the two nodes belonging to a link
$ν_{o} (m, n)$	Original QKD key rate on link $(m, n)$ , $ν_{o} (m, n) \in K_{o}$
$ν_{n} (m, n)$	New QKD key rate on link ( $m, n$ ), $ν_{n} (m, n) \in K_{n}$
$γ (s_{γ}, d_{γ}, k_{γ}, β_{o})$	Original QKD service, $γ (s_{γ}, d_{γ}, k_{γ}, β_{o}) \in R_{o}$
$α (s_{α}, d_{α}, k_{α}, β_{n})$	Protocol upgrading request, $α (s_{α}, d_{α}, k_{α}, β_{n}) \in R_{n}$
$s_{γ}$	Source node of the original QKD service $γ$
$s_{α}$	Source node of the protocol upgrading request $α$
$d_{γ}$	Destination node of the original QKD service $γ$
$d_{α}$	Destination node of the protocol upgrading request $α$
$k_{γ}$	Key rate required for the original QKD service $γ$
$k_{α}$	Key rate required for the protocol upgrading request $α$
$β_{o}$	Max number of paths for the original QKD protocol (i.e., K in the K-shortest path algorithm)
$β_{n}$	Max number of paths for the new QKD protocol (i.e., K in the K-shortest path algorithm)
$B$	Max number of channels on each link
$δ_{i}^{γ} (m, n)$	Flag of whether the link ( $m, n$ ) is included in path- $i$ of the original QKD service $γ, {i \in 1, 2, \dots, β_{o}}$ , in which path- $i$ is generated by the K-shortest path algorithm. It is equal to 1 if the link ( $m, n$ ) is included and 0 otherwise.
$δ_{i}^{α} (m, n)$	Flag of whether the link ( $m, n$ ) is included in path- $i$ of the protocol upgrading request $α, {i \in 1, 2, \dots, β_{n}}$ , in which path- $i$ is generated by the K-shortest path algorithm. It is equal to 1 if the link ( $m, n$ ) is included and 0 otherwise.
$h_{o}$	Hop limitation for the original QKD protocol
$t_{o} (m, n)$	Time resources required for the original protocol per unit of time on link ( $m, n$ )
$t_{a} (m, n)$	Time resources required for the new protocol per unit of time on link ( $m, n$ )
$c_{o} (m, n)$	Number of channels already existing on link ( $m, n$ )
$c_{a} (m, n)$	Number of channels to be added on link ( $m, n$ )
$x_{i}^{γ}$	Continuous variable that indicates the time resources allocated for the service $γ (s_{γ}, d_{γ}, k_{γ}, β_{o})$ at path- $i$ per unit of time, $i \in {1, 2, \dots, β_{o}}$
$x_{i}^{α}$	Continuous variable that indicates the time resources allocated for the request $α (s_{α}, d_{α}, k_{α}, β_{n})$ at path- $i$ per unit of time, $i \in {1, 2, \dots, β_{n}}$
$ε_{α}$	Boolean variable that is equal to 1 if the request $α$ is succeeded and 0 otherwise
$φ$	Max value of the number of successful requests calculated in stage-1 of the model
$C_{Q P U}$	Cost of QKD protocol upgrading
TRO	Total time resources occupied by QKD protocols
TRP	Total time resources provided after protocol upgrading
${T R U}_{Q P U}$	Time resource utilization of protocol upgrading
${S P}_{Q P U}$	Success probability of protocol upgrading requests

Notation	Definition
$G (V, E)$	MQON topology
$V$	Set of nodes on the MQON topology
$E$	Set of links on the MQON topology
$K_{o}$	Set of original QKD key rates on each link
$K_{n}$	Set of new QKD key rates on each link
$R_{o}$	Set of original QKD services (implementing a single QKD protocol)
$R_{n}$	Set of protocol upgrading requests
$R_{s}$	Set of successful protocol upgrading requests
$T_{o}$	Set of time resources required for the original protocol per unit of time on each link
$T_{a}$	Set of time resources required for the new protocol per unit of time on each link
$C_{o}$	Set of the number of channels already on link ( $m, n$ )
$C_{a}$	Set of the number of channels added on link ( $m, n$ )
$m, n$	Indices of the two nodes belonging to a link
$ν_{o} (m, n)$	Original QKD key rate on link $(m, n)$ , $ν_{o} (m, n) \in K_{o}$
$ν_{n} (m, n)$	New QKD key rate on link ( $m, n$ ), $ν_{n} (m, n) \in K_{n}$
$γ (s_{γ}, d_{γ}, k_{γ}, β_{o})$	Original QKD service, $γ (s_{γ}, d_{γ}, k_{γ}, β_{o}) \in R_{o}$
$α (s_{α}, d_{α}, k_{α}, β_{n})$	Protocol upgrading request, $α (s_{α}, d_{α}, k_{α}, β_{n}) \in R_{n}$
$s_{γ}$	Source node of the original QKD service $γ$
$s_{α}$	Source node of the protocol upgrading request $α$
$d_{γ}$	Destination node of the original QKD service $γ$
$d_{α}$	Destination node of the protocol upgrading request $α$
$k_{γ}$	Key rate required for the original QKD service $γ$
$k_{α}$	Key rate required for the protocol upgrading request $α$
$β_{o}$	Max number of paths for the original QKD protocol (i.e., K in the K-shortest path algorithm)
$β_{n}$	Max number of paths for the new QKD protocol (i.e., K in the K-shortest path algorithm)
$B$	Max number of channels on each link
$δ_{i}^{γ} (m, n)$	Flag of whether the link ( $m, n$ ) is included in path- $i$ of the original QKD service $γ, {i \in 1, 2, \dots, β_{o}}$ , in which path- $i$ is generated by the K-shortest path algorithm. It is equal to 1 if the link ( $m, n$ ) is included and 0 otherwise.
$δ_{i}^{α} (m, n)$	Flag of whether the link ( $m, n$ ) is included in path- $i$ of the protocol upgrading request $α, {i \in 1, 2, \dots, β_{n}}$ , in which path- $i$ is generated by the K-shortest path algorithm. It is equal to 1 if the link ( $m, n$ ) is included and 0 otherwise.
$h_{o}$	Hop limitation for the original QKD protocol
$t_{o} (m, n)$	Time resources required for the original protocol per unit of time on link ( $m, n$ )
$t_{a} (m, n)$	Time resources required for the new protocol per unit of time on link ( $m, n$ )
$c_{o} (m, n)$	Number of channels already existing on link ( $m, n$ )
$c_{a} (m, n)$	Number of channels to be added on link ( $m, n$ )
$x_{i}^{γ}$	Continuous variable that indicates the time resources allocated for the service $γ (s_{γ}, d_{γ}, k_{γ}, β_{o})$ at path- $i$ per unit of time, $i \in {1, 2, \dots, β_{o}}$
$x_{i}^{α}$	Continuous variable that indicates the time resources allocated for the request $α (s_{α}, d_{α}, k_{α}, β_{n})$ at path- $i$ per unit of time, $i \in {1, 2, \dots, β_{n}}$
$ε_{α}$	Boolean variable that is equal to 1 if the request $α$ is succeeded and 0 otherwise
$φ$	Max value of the number of successful requests calculated in stage-1 of the model
$C_{Q P U}$	Cost of QKD protocol upgrading
TRO	Total time resources occupied by QKD protocols
TRP	Total time resources provided after protocol upgrading
${T R U}_{Q P U}$	Time resource utilization of protocol upgrading
${S P}_{Q P U}$	Success probability of protocol upgrading requests

Abstract

Cited By

Figures (9)

Tables (3)

Equations (15)

Journal of Optical Communications and Networking