发表机构
Indian Institute of Information Technology Dharwad（达尔瓦德信息与技术学院）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
提出一种相干感知路由协议，通过优先级调制老化模型将退相干约束集成到路径选择中，在多种拓扑下显著提升保真度与吞吐量，优于传统路由和调度方法。
AI 中文摘要
量子网络面临一个经典网络中不存在的基本挑战：有限的存储器相干时间意味着排队延迟直接降低信息质量，导致没有经典模拟的退相干。现有的路由协议优化跳数或信道保真度，而将调度延迟视为次要问题，使保真度容易受到拥塞引起的退相干的影响。我们提出了一种相干感知路由协议，通过从加权公平排队理论解析推导的优先级调制老化模型，将退相干约束集成到路径选择中，其中高优先级流量获得压缩的有效排队延迟。我们构建了一个自定义离散事件模拟器，与NetSquid（跨104个状态）进行了验证，并在相同物理参数下评估了两种结构不同的拓扑类别，将拓扑结构作为唯一的独立变量。在所有实验中，我们的协议以仅损失Dijkstra路由和FIFO调度作为基线进行基准测试。在拓扑上，P2流量在9倍负载增加下实现了96.08%的保真度，仅下降了0.04个百分点，而仅损失基线下降了13.51个百分点；P2尾部延迟稳定在0.055毫秒，而Dijkstra则恶化了5.5倍。在Barabasi-Albert无标度拓扑上，我们的协议在运行负载下比基线提供了+4.12个百分点的保真度优势和97.8%更高的总吞吐量，并在160k QPS处清晰表征了枢纽饱和边界。FIFO调度在两种拓扑类别上提供的优先级区分可忽略不计，这有力地证明了相干感知路由（而非仅调度）是观察到的服务质量提升的原因。
英文摘要
Quantum networks face a fundamental challenge absent in classical networks; finite memory coherence times mean that queuing delay directly degrades information quality, causing decoherence that has no classical analog. Existing routing protocols optimize for hop count or channel fidelity while treating scheduling delays as a secondary concern, leaving fidelity vulnerable to congestion-induced decoherence. We present a coherence-aware routing protocol that integrates decoherence constraints into path selection via a priority-modulated aging model derived analytically from Weighted Fair Queueing theory, where high-priority traffic receives compressed effective queue delay. We build a custom discrete-event simulator verified against NetSquid (across 104 states), and evaluate across two structurally diverse topology classes under identical physical parameters, isolating topology structure as the sole independent variable. In all experiments, our protocol is benchmarked against loss-only Dijkstra routing and FIFO scheduling as baselines. On topologies, P2 traffic achieves 96.08% fidelity under a 9x load increase with only 0.04 percentage point degradation, versus a 13.51 percentage point collapse for the loss-only baseline; P2 tail latency holds stable at 0.055 ms while Dijkstra degrades 5.5x. On Barabasi-Albert scale-free topologies, our protocol delivers a +4.12 percentage point fidelity advantage with 97.8% higher aggregate throughput at operational loads over the baseline, with a clearly characterized hub-saturation boundary at 160k QPS. FIFO scheduling provides negligible priority differentiation on both topology classes, providing strong evidence that coherence-aware routing-not scheduling alone is responsible for the observed QoS gains.
Comments10 pages and 3 figures
