Metraipolis › archive › dc_52befb2280f8

Reliability-Guided Trusted Repeater Node Selection in QKD-Enabled Metro Optical Networks — arXiv:2609.18797

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.18797
License (as archived)
CC0-1.0
Archived
2026-10-15T15:38:59.518Z
SHA-256 of the archived text
4c7611ed425e58b2d36d910923fa768d76ebbb86278774f0c6e53f75c96b1447
Stable URL of this page
https://metraipolis.com/documento/dc_52befb2280f8

How to cite

Reliability-Guided Trusted Repeater Node Selection in QKD-Enabled Metro Optical Networks — arXiv:2609.18797 — arXiv (en), https://arxiv.org/abs/2609.18797 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_52befb2280f8 (Metraipolis archive dc_52befb2280f8, sha256 4c7611ed425e58b2d36d910923fa768d76ebbb86278774f0c6e53f75c96b1447)
BibTeX
@misc{dc52befb2280f8,
  title = {Reliability-Guided Trusted Repeater Node Selection in QKD-Enabled Metro Optical Networks — arXiv:2609.18797},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.18797},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_52befb2280f8; sha256 4c7611ed425e58b2d36d910923fa768d76ebbb86278774f0c6e53f75c96b1447},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18797. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Quantum Key Distribution (QKD) in optical networks can provide information-theoretic security but is limited by its operability range, thereby requiring repeater nodes for extended coverage. Existing works typically assume that all repeater nodes and their associated key management systems are fully trusted, overlooking the risks posed by software exploits and insider threats. To address this, in this work, we propose a Bayesian fusion-based model to quantify the trustworthiness of each node. We have formulated a reliability-guided Trusted Repeater Node (TRN) selection framework for metro optical networks, where each node is assigned a trust score. We have subsequently mapped this trust score to link weights, which in turn has been used for reliable path computation for TRN selection, using the Dijkstra algorithm. We have also ranked the nodes using a composite score combining eigenvector and betweenness centrality, to capture their topographical relevance in the network. Simulation results on a reference topology demonstrate that the proposed method achieves approximately 8.93% higher path coverage than traditional centrality-based approaches like degree centrality, using the same number (around ten) of TRNs, thereby supporting reliable and resilient TRN selection for QKD-enabled optical networks.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-17 in cs.NI).
Categorie arXiv: Networking and Internet Architecture (cs.NI).
Pagina del lavoro: https://arxiv.org/abs/2609.18797 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T15:04:48.406Z dalla pagina https://arxiv.org/catchup/cs.NI/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).