|
To summarize the contributions, we introduce a two-stage relay selection strategy that operates strictly within the failure-affected branch-off region Ku, prioritizing a backbone-oriented fast search and using a branch-region search only when necessary, which balances bounded path stretch and guaranteed connectivity while reducing computation. We also propose a snapshot-based local recovery framework with first-packet paving to install temporary, loop-free forwarding entries using only local information, eliminating network-wide flooding and minimizing control overhead. Finally, we provide analytical guarantees for loop-freedom and efficiency, and validate the performance gains through NS-3 simulations across diverse multi-failure scenarios. |