Abstract
Quantum networks (QNs) gradually gain significant attention due to their higher security compared with classical networks. Conventional approaches in QN routing often aggregate multiple requests into a batch before determining their routing paths. However, this approach may overlook the limited lifetime of qubits, resulting in critical decoherence. In this paper, we present a new online entanglement routing architecture with an online optimization problem and propose a novel [1, O(log |V |)]- competitive algorithm supporting online requests with admission control, aiming to maximize the number of admitted requests. Finally, extensive simulation results show that our algorithm can outperform the existing approaches by up to 98%.