Finding disjoint paths in networks
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
IEEE/ACM Transactions on Networking (TON)
A Polynomial Solution to the Undirected Two Paths Problem
Journal of the ACM (JACM)
Communications of the ACM
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Reliable Backup Routing in Fault Tolerant Real-Time Networks
ICON '01 Proceedings of the 9th IEEE International Conference on Networks
Approximating optimal spare capacity allocation by successive survivable routing
IEEE/ACM Transactions on Networking (TON)
Economical protection in MPLS networks
Computer Communications
Many-to-Many disjoint path covers in a graph with faulty elements
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient distributed solution for MPLS fast reroute
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Building reliable MPLS networks using a path protection mechanism
IEEE Communications Magazine
Routing bandwidth guaranteed paths with local restoration in label switched networks
IEEE Journal on Selected Areas in Communications
Fault tolerance and security issues in MPLS networks
ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science
QoS-aware path switching for VoIP traffic using SCTP
Computer Standards & Interfaces
| Hi-index | 0.00 |
Multi-protocol label switching (MPLS) is an evolving network technology that is used to provide traffic engineering (TE) and high speed networking. Internet service providers, which support MPLS technology, are increasingly demanded to provide high quality of service (QoS) guarantees. One of the aspects of QoS is fault tolerance. It is defined as the property of a system to continue operating in the event of failure of some of its parts. Fault tolerance techniques are very useful to maintain the survivability of the network by recovering from failure within acceptable delay and minimum packet loss while efficiently utilizing network resources. In this paper, we propose a novel approach for fault tolerance in MPLS networks. Our approach uses a modified (k, n) threshold sharing scheme with multi-path routing. An IP packet entering MPLS network is partitioned into n MPLS packets, which are assigned to node/link disjoint LSPs across the MPLS network. Receiving MPLS packets from k out of n LSPs are sufficient to reconstruct the original IP packet. The approach introduces no packet loss and no recovery delay while requiring reasonable redundant bandwidth. In addition, it can easily handle single and multiple path failures.