.jpg) |
Phase II provides two important guarantees. As long as the network remains physically connected, the constrained search on Ku will not miss an available route, and because the search space is restricted to Ku, its computation and energy cost are far lower than running a global shortest-path computation on the entire network.
Loop-freedom follows from how the repaired segments are constructed. Each repair segment either follows a tree path in a shortest path tree or follows a shortest path on the purified topology, making it loop-free by construction. During recursive upgrades under multiple failures, the failure set only grows, newly failed nodes are pruned out of the view, and temporary entries have finite lifetimes with a latest-first selection rule, so outdated rules do not persist and packets do not get trapped in stable loops. |
IEEE/ICACT20260346 Slide.19
[Big Slide]
[YouTube]