Editing Distributed Routing in a Quantum Internet
Jump to navigation
Jump to search
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 62: | Line 62: | ||
* During the path discovery phase (<math>\mathbf{PathDisc}</math>) each node decides the next hop on the basis of the physical graph topology and the information it has about the shared entangled links with its neighbours. | * During the path discovery phase (<math>\mathbf{PathDisc}</math>) each node decides the next hop on the basis of the physical graph topology and the information it has about the shared entangled links with its neighbours. | ||
* In this phase given a demand <math>D_{v,e}</math> if <math>v</math> is an optimal neighbour of <math>u</math> to reach a destination node <math>e</math> then the routing algorithm has | * In this phase given a demand <math>D_{v,e}</math> if <math>v</math> is an optimal neighbour of <math>u</math> to reach a destination node <math>e</math> then the routing algorithm has two options: | ||
** (1) Select the path via <math>v</math> and generate sufficient amount of links between <math>u, v</math> - see '''Algorithm 2 - Modified Greedy''' | ** (1) Select the path via <math>v</math> and generate sufficient amount of links between <math>u, v</math> - see '''Algorithm 2 - Modified Greedy''' | ||
** (2) | ** (2) Vertex <math>u</math> try to select another neighbour with whom it already shares enough amount of entangled links - see '''Algorithm 3 - Local Best Effort''' | ||
* | |||
* Analyzing Algorithm 3 under the assumption that the quantum repeater nodes have information about its neighbours as well as the neighbours of the neighbours in the virtual graph is '''Algorithm 4 - NoN Local Best Effort'''. | |||
==Properties== | ==Properties== | ||
Line 83: | Line 84: | ||
# [https://arxiv.org/abs/1610.05238 Schoute et al. (2016)] | # [https://arxiv.org/abs/1610.05238 Schoute et al. (2016)] | ||
<div style='text-align: right;'>''contributed by Lucas Arenstein''</div> | |||
<div style='text-align: right;'>'' | |||