Distributed Routing in a Quantum Internet: Difference between revisions
Jump to navigation
Jump to search
Distributed Routing in a Quantum Internet (edit)
Revision as of 19:03, 6 January 2022
, 6 January 2022Edit by Lucas: Corrections and suggestions from our last talk - Removed Kaushik's name
(First version of the page made by Lucas.) |
(Edit by Lucas: Corrections and suggestions from our last talk - Removed Kaushik's name) |
||
| 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 three 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) Try to select another neighbour with whom it already shares enough amount of entangled links - see '''Algorithm 3 - Local Best Effort''' | ||
** (3) (2) + Assume that the quantum repeater nodes have information about its neighbours as well as the neighbours of the neighbours in the virtual graph - see '''Algorithm 4 - NoN Local Best Effort'''. | |||
* | |||
==Properties== | ==Properties== | ||
| Line 84: | Line 83: | ||
# [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;'>'' | <!-- Version 1 --> | ||
<div style='text-align: right;'>''Contributed by Lucas Arenstein during the QOSF Mentorship Program''</div> | |||
<div style='text-align: right;'>''Mentor: Shraddha Singh</div> | |||