The complexity of finding two disjoint paths with min-max objective function
Discrete Applied Mathematics
High availability path design in ring-based optimal networks
IEEE/ACM Transactions on Networking (TON)
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Telecommunication System Engineering
Telecommunication System Engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reliability of Computer Systems and Networks: Fault Tolerance,Analysis,and Design
Reliability of Computer Systems and Networks: Fault Tolerance,Analysis,and Design
Surviving Multiple Network Failures Using Shared Backup Path Protection
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Optical WDM Networks (Optical Networks)
Optical WDM Networks (Optical Networks)
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Availability analysis of span-restorable mesh networks
IEEE Journal on Selected Areas in Communications
An overview of algorithms for network survivability
ISRN Communications and Networking
| Hi-index | 0.00 |
This paper investigates the subject of reliability via two link-disjoint paths in mesh networks. We address the issues of how reliable two-path protection can be and how to achieve the maximum reliability. This work differs from traditional studies, such as MIN-SUM, MIN-MAX, and MIN-MIN, in that the objective in this paper is to maximize the reliability of the two-path connection given the link reliability, or equivalently, to minimize the end-to-end failure probability. We refer to this problem as MAX-REL. Solving MAX-REL provides 100% protection against a single failure while maximizing the reliability regardless of how many link failures occur in the network. We prove that this problem is NP-complete and derive a corresponding upper bound, which is the theoretical maximum reliability for a source-destination pair, and a lower bound, which is the worst case of the proposed algorithm. The time efficiency of the algorithms is analyzed, and the performance of the algorithms is evaluated through simulation. We demonstrate that our heuristic algorithms not only achieve a low computing complexity, but also achieve nearly equivalent performance to the upper bound.