Name
Abstract | ||
|---|---|---|
The present research aims to recover network failure in networks with a complicated topology by focusing on tie-sets. A tie-set implies a set of links constituting a loop. The entire network is divided into smaller local units of tie-sets which encompass all network vertices and links. These units realize network management for quick and flexible failure recovery. This paper first introduces the concept of tie-sets, and then proposes a recovery method for single link failures. The latter half of the paper deals with the efficiency of failure recovery in different spanning trees. Since a hypothesis is formed by a numerical evaluation the paper proposes a method of determining a spanning tree for quick link failure recovery. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/WAINA.2011.125 | AINA Workshops |
Keywords | Field | DocType |
network management,failure recovery,recovery method,network failure recovery,paper deal,single link failure,quick link failure recovery,flexible failure recovery,network failure,entire network,network vertex,protocols,topology,mesh networks,multiplexing,spanning tree,mesh network,recovery,spanning trees,network topology,set theory,graph theory | Graph theory,Set theory,Mesh networking,Vertex (geometry),Computer science,Computer network,Network topology,Spanning tree,Network management,Multiplexing,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.35 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kiyoto Kadena | 1 | 1 | 0.35 |
| Kiyoshi Nakayama | 2 | 27 | 7.51 |
| Norihiko Shinomiya | 3 | 50 | 19.15 |