|
In a shortest path tree, when a node fails, it effectively severs its entire downstream subtree. UW-LFRR captures this with a branch-off abstraction: for each failed node, it defines the set of downstream nodes whose tree paths must traverse that failed node, and then unions these sets into a failure-affected region Ku. The key role of Ku is to turn what looks like a network-wide problem into a localized subgraph problem, so subsequent relay selection and searching are confined to Ku rather than the whole network. |