Enhancing Robustness Under Dual-Link Failures

—In this paper, we show that minimizing the product of path lengths results in minimizing the probability of connection failure between a source and destination given two links have failed in the network. We, therefore, analyze the problem of finding disjoint paths between two nodes with the minimum path length product. We formulate the problem as a Mixed Integer Quadratic Programming (MIQP) problem. We develop an iterative heuristic based on k-shortest path approach. We demonstrate through extensive simulations that only a few iterations are sufficient to obtain paths whose path length product is comparable to that of optimal obtained by solving the MIQP.

• Type: Conference
• Year: 2007
• Where: ICCCN
• Authors: Sandeep Kour Ahuja, Srinivasan Ramasubramanian
• Keywords: ICCCN 2007, Minimum Path Length, Path Length, Path Length Product