Tie-set Based Fault Tolerance for autonomous recovery of double-link failures

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 auto...

Full description

Saved in:
Bibliographic Details
Published in2013 IEEE Symposium on Computers and Communications (ISCC) pp. 000391 - 000397
Main Authors Nakayama, Kiyoshi, Benson, Kyle E., Avagyan, Vahe, Dillencourt, Michael B., Bic, Lubomir F., Venkatasubramanian, Nalini
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2013
Subjects
autonomous recovery
Complexity theory
Distributed algorithms
double-link failures
Fault tolerance
Fault tolerant systems
Graph theory
loop
Ports (Computers)
Protocols
tie-set
Online AccessGet full text

Cover

More Information
Summary: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).
ISSN:1530-1346
2642-7389
DOI:10.1109/ISCC.2013.6754978