Name
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. If tie-sets are used as local management units, high-speed and stable fail-over can be realized by taking advantage of ring-based restoration. This paper first introduces the notion of tie-sets, and then describes the distributed algorithms for link failure. Experimental results comparing the proposed method with RSTP suggest that our method alleviates the influence of failure in terms of route switching points, adverse effect in communications, and recovery time with a modest increase in state information of a node. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ISCC.2011.5983916 | Computers and Communications |
Keywords | Field | DocType |
distributed control,information networks,set theory,distributed control method,graph theory,information network,link failure recovery,ring-based restoration,single link failure,tie-sets concept,graph theory,link failure,loop,tie-set | Graph theory,Set theory,Mesh networking,Information networks,State information,Computer science,Computer network,Network topology,Distributed algorithm,Distributed computing | Conference |
ISSN | ISBN | Citations |
1530-1346 E-ISBN : 978-1-4577-0678-3 | 978-1-4577-0678-3 | 2 |
PageRank | References | Authors |
0.48 | 2 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kiyoshi Nakayama | 1 | 27 | 7.51 |
| Shinomiya, N. | 2 | 2 | 0.48 |