论文标题
量子网络中的机会主义路由
Opportunistic Routing in Quantum Networks
论文作者
论文摘要
与经典的路由算法不同，量子路由算法利用纠缠状态 - 一种资源的寿命有限且消耗后需要再生。简而言之，量子路由算法必须有效地使用这些资源，同时优化一些目标，例如总等待时间。当前的路由算法倾向于保持路由请求等待，直到其路径上的所有资源可用。在本文中，我们介绍了一种以机会主义方式管理纠缠资源的新方法：一个请求可以尽快沿其道路前进（即使其道路上的某些资源尚未准备就绪）。我们表明，这种机会主义的方法在根本上比常规方法更好。特别是，我们的结果表明，与几种最新的路由算法相比，这种新方法的平均总等待时间和平均链接等待时间提高了30-50％。作为这项工作的副产品，我们开发了一种用于量子路由的新模拟器，该模拟器可用于评估不同情况下的各种设计选择。
Unlike classical routing algorithms, quantum routing algorithms make use of entangled states - a type of resources that have a limited lifetime and need to be regenerated after consumption. In a nutshell, quantum routing algorithms have to use these resources efficiently, while optimizing some objectives such as the total waiting time. Current routing algorithms tend to keep a routing request waiting until all of the resources on its path are available. In this paper, we introduce a new way of managing entanglement resources in an opportunistic fashion: a request can move forward along its path as soon as possible (even if some resources on its path are not ready). We show that this opportunistic approach is fundamentally better than conventional approaches. In particular, our results indicate that this new approach achieves a 30-50% improvement in the average total waiting time and average link waiting time compared with several state-of-the-art routing algorithms. As a by-product of this work, we develop a new simulator for quantum routing, which can be used to evaluate various design choices under different scenarios.
