Editing Distributed Routing in a Quantum Internet (section)

==Outline==
<!-- A non-mathematical detailed outline which provides a rough idea of the concerned protocol -->
In [https://arxiv.org/abs/1907.11630 (1)] they develop routing algorithms with the goal of minimizing the latency of the network to serve a request to create entanglement between two distant nodes in the network. They consider two models for the operation of the quantum network: a '''continuous''' model, in which entanglement between a subset of the nodes is
produced continuously in the background that in principle allows the rapid creation of entanglement between distant nodes using the already pre-generated entanglement pairs and a '''on-demand''' model, where entanglement production does not commence before a request is made. Their distributed routing algorithm is studied considering three different path discovery algorithms: Modified Greedy Routing, Local Best Effort Routing and NoN Local Best Effort Routing. All of these strategies are simulated on the ring, grid and recursively generated network topology.