| Virual Oral Presentation Slide by Slide |
IEEE/ICACT20260346 Slide.10
[Big Slide]
[YouTube] |
Oral Presentation |
|
|
Before any failures, each node maintains a network-wide topology snapshot and builds a local shortest path tree based on hop count. Once failures occur, the snapshot is inevitably stale, but UW-LFRR does not attempt to enforce strong consistency during CBZ. Instead, it explicitly accepts that inconsistency exists and applies conservative local corrections based on the failures the node can perceive. | |
| [Go to Next Slide] |