DocumentCode
3455139
Title
Tie-set Based Fault Tolerance for autonomous recovery of double-link failures
Author
Nakayama, Keisuke ; Benson, Kyle E. ; Avagyan, Vahe ; Dillencourt, Michael B. ; Bic, Lubomir F. ; Venkatasubramanian, N.
Author_Institution
Dept. of Comput. Sci., Univ. of California, Irvine, Irvine, CA, USA
fYear
2013
fDate
7-10 July 2013
Abstract
In this paper, we propose a mechanism for coping with double-link failures in an autonomous and distributed manner. We call it Tie-set Based Fault Tolerance (TBFT) because it utilizes tie-sets, which represent a set of the edges comprising a loop within the graph that represents the network. An autonomous distributed control method based on dividing a network into a set of tie-sets, whose union covers every edge in the network, has been verified to be more effective than traditional tree-based restoration techniques in case of single link failure. The proposed method efficiently and gracefully handle double-link failures and also decrease the communication overhead incurred during network configuration. We demonstrate these results by simulating and comparing TBFT with the traditional approach of using Rapid Spanning Tree Protocol (RSTP).
Keywords
distributed algorithms; fault tolerant computing; network theory (graphs); trees (mathematics); RSTP; TBFT; autonomous distributed control method; autonomous recovery; double-link failures; graph loop; network edge; rapid spanning tree protocol; single link failure; tie-set based fault tolerance; tree-based restoration techniques; Complexity theory; Distributed algorithms; Fault tolerance; Fault tolerant systems; Graph theory; Ports (Computers); Protocols; autonomous recovery; double-link failures; fault tolerance; graph theory; loop; tie-set;
fLanguage
English
Publisher
ieee
Conference_Titel
Computers and Communications (ISCC), 2013 IEEE Symposium on
Conference_Location
Split
Type
conf
DOI
10.1109/ISCC.2013.6754978
Filename
6754978
Link To Document