Name
Title | ||
|---|---|---|
Finding Tie-sets with the Minimal Number of Total Elements for Effective Failure Recovery. |
Abstract | ||
|---|---|---|
This paper introduces the failure recovery method using ring structures called tie-sets and proposes an algorithm to search a set of tie-sets which generate a shorter detour path in the case of a link failure. The idea of tie-sets, which is defined in the graph theory, is to divide a mesh network into logical loops and manage a failure with them. The tie-set recovery method works on a mesh network in the same manner as ring based protection schemes. When applying this method, it is necessary to consider how the tie-sets cover an entire network since the length of a detour path is determined by the size of a tie-set. Experimental results illustrate that obtained tie-sets generate a short detour path compared with the shortest path algorithm. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2967878.2967888 | ICCCNT |
Field | DocType | Citations |
Graph theory,Mesh networking,Approximation algorithm,Algorithm,Mathematics,Dijkstra's algorithm | Conference | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mitsunobu Homma | 1 | 0 | 0.34 |
| Norihiko Shinomiya | 2 | 50 | 19.15 |