Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/5512
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMarik, Arup Kumar-
dc.contributor.authorPalit, Basabdatta-
dc.contributor.authorBehera, Sadananda-
dc.date.accessioned2026-01-01T11:17:30Z-
dc.date.available2026-01-01T11:17:30Z-
dc.date.issued2025-12-
dc.identifier.citationIEEE Global Communications Conference (GLOBECOM), Taipei, Taiwan, 08–12 December 2025en_US
dc.identifier.urihttp://hdl.handle.net/2080/5512-
dc.descriptionCopyright belongs to the proceeding publisher.en_US
dc.description.abstractQuantum Key Distribution (QKD) provides information-theoretic security, but is limited by distance in optical networks, thereby requiring repeater nodes to extend coverage. Existing works usually assume all repeater nodes and associated Key Management Servers (KMSs) to be Trusted Repeater Nodes (TRNs), while ignoring risks from software exploits and insider threats. In this paper, we propose a reliability-aware TRN placement framework for metro optical networks, which assigns each node a trust score and integrates it into the Dijkstra algorithm via weighted links. We then rank the nodes using a composite score, which is a weighted combination of betweenness centrality and eigenvector centrality to enable a secure and scalable TRN deployment. Simulation results on a reference topology show that our method covers 10.77% more shortest paths compared to traditional metrics like degree centrality, using the same number (around eight) of TRNs, making it suitable for TRN selection to maximize secure connectivity.en_US
dc.subjectQuantum Key Distributionen_US
dc.subjectTrusted Repeater Nodeen_US
dc.subjectNode Reliabilityen_US
dc.subjectCentrality Measuresen_US
dc.titleTrusted Repeater Placement in QKD-enabled Optical Networksen_US
dc.typeArticleen_US
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
2025_GLOBECOM_AKMarik_Trusted.pdf1.23 MBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.