Learn More
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers from any single link-failure immediately after the failure occurs. It is shown that this scheme always works if the network is given as a two-edge-connected symmetric digraph and(More)
We introduce a new recovery scheme that needs only one extra backup routing table for networks employing shortest-path routing. By precomputing this backup table, the network recovers from any single link failure immediately after the failure occurs. To compute the backup routing table for this scheme, we use an almost linear time algorithm to solve the {r,(More)
—Many dynamic metrics for wireless mesh networks (WMNs) to improve communication quality are proposed so far. However, all of them have possibility to create temporary routing loops which may cause severe congestion and disruption of communications. In order that WMNs are regarded as a reliable infrastructure of the next generation, such routing loops are(More)