By Topic

An Autonomous Distributed Control Method for Link Failure Based on Tie-Set Graph Theory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Nakayama, K. ; Dept. of Comput. Sci., Univ. of California, Irvine, Irvine, CA, USA ; Shinomiya, N. ; Watanabe, H.

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.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:59 ,  Issue: 11 )