Proof of a modified Dijkstra's algorithm for computing shortest bundle delay in networks with deterministically time-varying links
D. C. Lee · IEEE Communications Letters · 2006
This paper presents and proves the correctness of a modified Dijkstra's algorithm that computes the shortest-delay path in networks with deterministically time-varying links. Examples of such networks include interplanetary, orbital (e.g., low Earth orbit) satellite, and sensor networks. This paper presents and proves the correctness of a modified Dijkstra's algorithm that computes the shortest-delay path in networks with deterministically time-varying links. Examples of such networks include interplanetary, orbital (e.g., low earth orbit) satellite, and sensor networks