Takuya Yoshihiro

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)
Suppose that some particular link in the Internet is currently congested. A natural solution is to try to make packets bypass that link. This can be done by increasing the cost of that link intentionally, say from a 1 to a 2, since the Internet uses shortest-path routing. Unfortunately, however, this often causes temporary loops for packet traveling, called(More)
Dynamic metric is a well-known method to improve performance of WMNs (Wireless Mesh Networks). By quantifying quality of links, and by computing optimal paths based on the values, dynamic metrics enable packets to be forwarded with high-quality links while avoiding low-quality links. ETX [1] would be the best-known dynamic metric, which measures the average(More)