Sharing entanglement among multiple users remains a central challenge for scalable quantum networks. Recent work proposed an on-demand entanglement packet architecture in which a controller uses a Time Division Multiple Access (TDMA) approach to allocate network resources. Quantum nodes are assigned a periodic schedule that probabilistically fulfills application requests for end-to-end entanglements. The schedule is recomputed periodically using well-known algorithms, such as Earliest Deadline First (EDF). However, a static schedule offers limited flexibility when outcomes are stochastic and arrivals are asynchronous. To overcome this limitation, we propose an online scheduler that dynamically schedules, defers, retries, or drops entanglement distribution reservations. In our simulations, the dynamic scheduler achieves lower completion time, higher completion ratio, and higher throughput than the static baseline. Furthermore, when the network is overloaded, the dynamic scheduler continues to construct deadline-feasible schedules and degrades gracefully.

翻译：在可扩展量子网络中，多用户间的纠缠共享仍是一大核心挑战。近期研究提出了一种按需纠缠数据包架构，其中控制器采用时分多址（TDMA）方法分配网络资源。量子节点被分配周期性调度，以概率方式满足应用对端到端纠缠的请求。该调度利用经典算法（如最早截止时间优先EDF）周期性重新计算。然而，当结果具有随机性且到达时间非同步时，静态调度灵活性有限。为克服这一局限，我们提出一种在线调度器，可动态执行、延迟、重试或丢弃纠缠分布预留。仿真实验表明，与静态基线相比，动态调度器实现了更低的完成时间、更高的完成率及更高的吞吐量。此外，当网络过载时，动态调度器仍能构建满足截止时间的可行调度，并实现性能优雅降级。