Name
Title | ||
|---|---|---|
An Autonomous Distributed Control Method for Link Failure Based on Tie-Set Graph Theory |
Abstract | ||
|---|---|---|
This study proposes an autonomous distributed control method for single link failure based on loops in a network. This method focuses on the concept of tie-sets defined by graph theory in order to divide a network into a string of logical loops. A tie-set denotes a set of links that constitutes a loop. Based on theoretical rationale of graph theory, a string of tie-sets that cover all the nodes and links can be created by using a tree, even in an intricately-intertwined mesh network. If tie-sets are used as local management units, high-speed and stable fail-over can be realized by taking full advantage of ring-based restoration. This paper first introduces the notion of tie-sets, and then describes the distributed algorithms for link failure. Experiments are conducted against Rapid Spanning Tree Protocol (RSTP), which is generally used for fault recovery in mesh topological networks. Experimental results comparing the proposed method with RSTP suggest that our method alleviates the adverse effects of link failure with a modest increase in state information of a node. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TCSI.2012.2196109 | Circuits and Systems I: Regular Papers, IEEE Transactions |
Keywords | Field | DocType |
Internet,computer network management,computer network reliability,distributed algorithms,distributed control,fault tolerant computing,telecommunication control,telecommunication network topology,trees (mathematics),RSTP,autonomous distributed control method,distributed algorithm,fault recovery,intricately-intertwined mesh network,local management unit,mesh topological network,rapid spanning tree protocol,ring-based restoration,single link failure,tie-set graph theory,Distributed control,fault tolerance,graph theory,link failure,loop,tie-set | Graph theory,Mesh networking,State information,Computer science,Network topology,Distributed algorithm,Distributed concurrency control,The Internet,Distributed computing,Spanning Tree Protocol | Journal |
Volume | Issue | ISSN |
59 | 11 | 1549-8328 |
Citations | PageRank | References |
7 | 0.91 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kiyoshi Nakayama | 1 | 27 | 7.51 |
| Norihiko Shinomiya | 2 | 50 | 19.15 |
| Hitoshi Watanabe | 3 | 24 | 4.87 |