 |
Then we come to the routing algorithm. Compared to the original Dijkstra algorithm, we introduced innovative routing metrics with nodes¡¯ resource availability and links¡¯ entanglement quality along the path included. To maximally loosen the requirement for qubit coherence time, an end-to-end entanglement generation will be started when all nodes on the path are prepared. Therefore, resource availability is depicted by the minimum node qubit capacity Ci and the maximum node availability Ti among the repeater nodes of a path. The entanglement quality is represented by both the product of fidelity on every link, and the sum of classical communication delay on each edge of the path. Finally we get the composite metric K of a path by the following formula, where k sub 1, k sub 2, k sub 3 ¡Ã 0 are parameters to adjust the routing strategy.
|
IEEE/ICACT20240378 Slide.12
[Big Slide]