A new approach for fault tolerance based on modified TSS model

This paper presents a new approach to provide fault tolerance in MPLS multicast networks. MPLS has been used to provide faster forwarding; combining with multicasting it further supports applications with improved service. Fault tolerance is therefore important for such networks. Our approach for fault tolerance is to divide and encode the traffic into multiple disjoint trees using a modified (k, n) Threshold Sharing scheme. Our approach can reconstruct the original traffic from any k out of n trees available. Therefore, in the event of node/link failure(s) of any (n-k) trees, our approach provides fault tolerance without introducing any recovery delay and packet loss. Moreover, our objective is also to minimize bandwidth utilization for protection purposes.

[1]  Michalis Faloutsos,et al.  An architecture for scalable, efficient, and fast fault-tolerant multicast provisioning , 2004, IEEE Network.

[2]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[3]  Young-Joo Suh,et al.  Software-Based Rerouting for Fault-Tolerant Pipelined Communication , 2000, IEEE Trans. Parallel Distributed Syst..

[4]  Murali S. Kodialam,et al.  Dynamic routing of bandwidth guaranteed multicasts with failure backup , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[5]  Anjali Agarwal,et al.  A Multiple Tree Approach for Fault Tolerance in MPLS Networks , 2007, ICDCIT.

[6]  Heon Young Yeom,et al.  Design and Implementation of Multiple Fault-Tolerant MPI over Myrinet (M^3) , 2005, ACM/IEEE SC 2005 Conference (SC'05).