All-or-Nothing Concurrent Entanglement Routing

Establishing entangled links by entangling and swapping can enable end-to-end teleportation, avoiding eavesdropping and facilitating the critical applications, such as quantum key distribution (QKD) service. For these promising applications, a specific number of data qubits should be transmitted (periodically) to meet the quality of service (QoS) requirements for each request. Otherwise, the network provider cannot earn the profit from the request. In this paper, we present a new optimization problem and propose a novel approximation algorithm to maximize the (expected) total profit under the constraint of network resources. Finally, extensive simulation results manifest that our algorithm can outperform the existing approaches by up to 46%.