Open access
Jul 2026
Improved Algorithms for Local Failover Routing on Directed Graphs
This paper studies local failover schemes that minimize the number of rewritable bits in the packet header on directed graphs with $k-arc failures and shows that their scheme is nearly optimal when the number of faulty arcs is approximately less than the number of nodes.
Yuki Kawashima, Naoki Kitamura, Taisuke Izumi
· IEICE Transactions on Fundam... · 0 citations