A multiple tree approach for fault tolerance in MPLS networks

Authors:
Sahel Alouneh;Anjali Agarwal;Abdeslam En-Nouaary
Affiliations:
Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada;Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada;Department of Electrical and Computer Engineering, Concordia University, Montreal, Canada
Venue:
ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Year:
2007

Citing 3
Cited 1

How to share a secret

Communications of the ACM
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
An architecture for scalable, efficient, and fast fault-tolerant multicast provisioning

IEEE Network: The Magazine of Global Internetworking

A New Approach for Security in MPLS Multicast Networks

ICDCIT '08 Proceedings of the 5th International Conference on Distributed Computing and Internet Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 strategy for fault tolerance is to divide and encode the traffic into multiple disjoint trees using a modified (k,n) Threshold Sharing scheme. Our scheme 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.