TY - GEN
T1 - RADAR-Q
T2 - 5th International Conference on Innovations in Computing Research, ICR 2026
AU - Tian, Chenliang
AU - Yang, Zebo
AU - Jain, Raj
AU - Kompella, Ramana
AU - Nejabati, Reza
AU - Kaur, Eneet
AU - Erbad, Aiman
AU - Abdallah, Mohamed
AU - Hamdi, Mounir
N1 - Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2027.
PY - 2027
Y1 - 2027
N2 - Scalable quantum networks must support concurrent entanglement requests from multiple users, yet existing routing protocols fail when users compete for shared repeater resources and waste fragile quantum states that decay rapidly and cannot be buffered like classical data. This paper presents RADAR-Q, a resource-aware decentralized routing protocol that embeds real-time resource contention directly into path selection. Unlike prior designs that either require global coordination or route all traffic through a central anchor, RADAR-Q makes intelligent local decisions by balancing three factors: (1) path length and link fidelity, (2) instantaneous availability of quantum memory at each node, and (3) the number of intermediate Bell-State Measurement (BSM) operations needed to connect a source–destination pair. By identifying the Nearest Common Ancestor (NCA) within a DODAG routing hierarchy, RADAR-Q localizes entanglement swapping close to the communicating users—avoiding unnecessary detours through the network center and reducing both the BSM chain length and qubit exposure to decoherence. We evaluate RADAR-Q on grid and random topologies—representing regular and irregular network fabrics, respectively—against state-of-the-art synchronous and root-centric asynchronous baselines. Results demonstrate that RADAR-Q achieves 2.5× and 7.6× higher aggregate throughput than synchronized and root-centric asynchronous designs, respectively. While baseline protocols suffer catastrophic fidelity collapse below the 0.5 distillation threshold [2] under high load, RADAR-Q consistently maintains end-to-end fidelity above 0.76—ensuring every generated pair remains physically usable for downstream quantum applications. Furthermore, RADAR-Q exhibits near-perfect fairness (Jain’s Fairness Index 96–98%) and retains over 50% of its ideal throughput even under stringent 1.0 ms coherence times. These findings establish contention-aware decentralized routing as a scalable foundation for multi-tenant quantum networks, with direct applicability to emerging quantum data center and distributed quantum computing environments.
AB - Scalable quantum networks must support concurrent entanglement requests from multiple users, yet existing routing protocols fail when users compete for shared repeater resources and waste fragile quantum states that decay rapidly and cannot be buffered like classical data. This paper presents RADAR-Q, a resource-aware decentralized routing protocol that embeds real-time resource contention directly into path selection. Unlike prior designs that either require global coordination or route all traffic through a central anchor, RADAR-Q makes intelligent local decisions by balancing three factors: (1) path length and link fidelity, (2) instantaneous availability of quantum memory at each node, and (3) the number of intermediate Bell-State Measurement (BSM) operations needed to connect a source–destination pair. By identifying the Nearest Common Ancestor (NCA) within a DODAG routing hierarchy, RADAR-Q localizes entanglement swapping close to the communicating users—avoiding unnecessary detours through the network center and reducing both the BSM chain length and qubit exposure to decoherence. We evaluate RADAR-Q on grid and random topologies—representing regular and irregular network fabrics, respectively—against state-of-the-art synchronous and root-centric asynchronous baselines. Results demonstrate that RADAR-Q achieves 2.5× and 7.6× higher aggregate throughput than synchronized and root-centric asynchronous designs, respectively. While baseline protocols suffer catastrophic fidelity collapse below the 0.5 distillation threshold [2] under high load, RADAR-Q consistently maintains end-to-end fidelity above 0.76—ensuring every generated pair remains physically usable for downstream quantum applications. Furthermore, RADAR-Q exhibits near-perfect fairness (Jain’s Fairness Index 96–98%) and retains over 50% of its ideal throughput even under stringent 1.0 ms coherence times. These findings establish contention-aware decentralized routing as a scalable foundation for multi-tenant quantum networks, with direct applicability to emerging quantum data center and distributed quantum computing environments.
KW - Contention-Aware Routing
KW - Entanglement Routing
KW - Multi-tenant Quantum Networks
KW - Quantum Repeaters
KW - Resource-aware Networking
UR - https://www.scopus.com/pages/publications/105047004914
U2 - 10.1007/978-3-032-32636-2_41
DO - 10.1007/978-3-032-32636-2_41
M3 - Conference contribution
AN - SCOPUS:105047004914
SN - 9783032326355
T3 - Lecture Notes in Networks and Systems
SP - 487
EP - 501
BT - Proceedings of the 5th International Conference on Innovations in Computing Research, ICR’26
A2 - Daimi, Kevin
A2 - Alsadoon, Abeer
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 24 August 2026 through 26 August 2026
ER -