Measurement-Device Placement in MDI-QKD Networks with Minimal Trusted Relays

📅 2026-09-06
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
本文研究了如何在MDI-QKD网络中优化放置测量设备以减少对可信中继的依赖,通过将问题形式化为混合整数线性规划来解决。
📝 Abstract
Measurement-Device-Independent Quantum Key Distribution (MDI-QKD) removes detector side-channel vulnerabilities by delegating measurements to an untrusted relay that, when shared by several user pairs, acts as a Bell-state measurement (BSM) hub. Channel loss still limits the reach of MDI-QKD links, so long-range services rely on trusted relays for key forwarding. As MDI-QKD moves toward metropolitan deployment, a key network-planning question arises: how should BSM hubs be placed on existing fiber infrastructure to minimize the use of trusted relays? In this work, we formalize this challenge as the MDI-QKD Hub Deployment (MHD) problem. We first prove that the MHD problem is NP-hard, and then formulate it as a Mixed-Integer Linear Programming (MILP). To the best of our knowledge, this is the first formulation for MDI-QKD network planning that captures the structural features specific to MDI-QKD, namely a shared BSM hub, two-link user-to-hub routing, and loss-balancing constraints, while jointly determining hub placement, user-to-hub assignment, and trusted-relay demand allocation. Our solution accounts for realistic budget and capacity constraints, including practical insights from real-world deployments of commercial MDI-QKD solutions. Numerical evaluations on three metropolitan topologies (12 to 50 nodes) at realistic geographic distances show that topology structure governs trusted-relay demand: hub placement alone eliminates all trusted relays in compact urban meshes, while in sparse topologies, relaxing the loss-balancing constraint removes the dominant source of trusted-relay usage at no additional infrastructure cost. The key-rate threshold at which trusted relays first appear shifts monotonically with the network diameter, i.e., the largest shortest-path distance between any node pair in fiber kilometers, delineating the feasibility boundary of pure MDI-QKD deployment.
Problem

Research questions and friction points this paper is trying to address.

MDI-QKD
BSM hub
trusted relays
network planning
channel loss
Innovation

Methods, ideas, or system contributions that make the work stand out.

MDI-QKD
Hub Placement
Mixed-Integer Linear Programming
Trusted Relays
Network Planning
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
T
Tianqu Luo
Politecnico di Milano, Italy
I
Ibrahim Arslantas
Politecnico di Milano, Italy
S
Sezin Ozturk
Politecnico di Milano, Italy
Q
Qiaolun Zhang
Politecnico di Milano, Italy
A
Alberto Sebastián-Lombraña
Universidad Politécnica de Madrid, Spain; Center for Computational Simulation, Madrid, Spain
Mehdi Bolourian
Mehdi Bolourian
David R. Cheriton School of Computer Science, University of Waterloo
5G and Beyond NetworksMobile Edge ComputingMachine LearningSecurity
J
Jiaheng Xiong
Politecnico di Milano, Italy
Francesco Musumeci
Francesco Musumeci
Associate Professor, Politecnico di Milano, Italy
Network Data Analysis - Network design and management - Disaster Resilience - Optical Networks
V
Vicente Martín
Universidad Politécnica de Madrid, Spain; Center for Computational Simulation, Madrid, Spain
Raouf Boutaba
Raouf Boutaba
Professor of Computer Science, University of Waterloo
Network ManagementNetwork VirtualizationCloud Resource Management
Massimo Tornatore
Massimo Tornatore
Professor of Communication Networks and Internet, Politecnico di Milano
Optical networksGreen networkingNetwork Function VirtualizationMachine Learning in Network Management