Introduction to algorithms
The complexity of finding two disjoint paths with min-max objective function
Discrete Applied Mathematics
Approaches for capacity and revenue optimization in suvivable WDM networks
Journal of High Speed Networks - Survivable optical networks - part I
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Survivability of lightwave networks — path lengths in WDM protection scheme
Journal of High Speed Networks - Special issue on survivable optical networks - part II
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Spare capacity allocation: model, analysis and algorithm
Spare capacity allocation: model, analysis and algorithm
Neural Network Based Algorithm for Multi-Constrained Shortest Path Problem
ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks
IEEE/ACM Transactions on Networking (TON)
k-penalty: a novel approach to find k-disjoint paths with differentiated path costs
IEEE Communications Letters
Minimum-cost multiple paths subject to minimum link and node sharing in a network
IEEE/ACM Transactions on Networking (TON)
Hardness of finding two edge-disjoint min-min paths in digraphs
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Cross-layer survivability in WDM-based networks
IEEE/ACM Transactions on Networking (TON)
On the complexity of the edge-disjoint min-min problem in planar digraphs
Theoretical Computer Science
Panorama weaving: fast and flexible seam processing
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
An efficient critical protection scheme for intra-domain routing using link characteristics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Finding paths with minimum shared edges
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
Finding a disjoint path pair is an important component in survivable networks. Since the traffic is carried on the active (working) path most of the time, it is useful to find a disjoint path pair such that the length of the shorter path (to be used as the active path) is minimized. In this paper, we first address such a Min-Min problem. We prove that this problem is NP-complete in either single link cost (e.g., dedicated backup bandwidth) or dual link cost (e.g., shared backup bandwidth) networks. In addition, it is NP-hard to obtain a K-approximation to the optimal solution for any K 1. Our proof is extended to another open question regarding the computational complexity of a restricted version of the Min-Sum problem in an undirected network with ordered dual cost links (called the MSOD problem). To solve the Min-Min problem efficiently, we introduce a novel concept called conflicting link set which provides insights into the so-called trap problem, and develop a divide-and-conquer strategy. The result is an effective heuristic for the Min-Min problem called COnflicting Link Exclusion (COLE), which can outperform other approaches in terms of both the optimality and running time. We also apply COLE to the MSOD problem to efficiently provide shared path protection and conduct comprehensive performance evaluation as well as comparison of various schemes for shared path protection. We show that COLE not only processes connection requests much faster than existing integer linear programming (ILP)-based approaches but also achieves a good balance among the active path length, bandwidth efficiency, and recovery time.