Diverse routing in networks with probabilistic failures
Name
Lee-2009-Diverse routing in networks with probabilistic failures.pdf
Size
204.79 KB
Format
Adobe PDF
Checksum (MD5)
10495b6bfea159163e9c249e7e04eeb4
Author(s)
Modiano, Eytan H.
Lee, Hyang-Won
Date Issued
June 2009
Journal
IEEE INFOCOM 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
Hyang-Won Lee, and E. Modiano. “Diverse Routing in Networks with Probabilistic Failures.” INFOCOM 2009, IEEE. 2009. 1035-1043. © 2010 Institute of Electrical and Electronics Engineers.
Version
Final published version
Abstract
We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failures, recovering from multiple failures is not guaranteed. In particular, events such as natural disasters or intentional attacks can lead to multiple correlated failures, for which recovery mechanisms are not well understood. We take a probabilistic view of network failures where multiple failure events can occur simultaneously, and develop algorithms for finding diverse routes with minimum joint failure probability. Moreover, we develop a novel Probabilistic Shared Risk Link Group (PSRLG) framework for modeling correlated failures. In this context, we formulate the problem of finding two paths with minimum joint failure probability as an Integer Non-Linear Program (INLP), and develop approximations and linear relaxations that can find nearly optimal solutions in most cases.
Subjects
disjoint path protection
diverse network routing
integer nonlinear program
intentional attacks
natural disasters
probabilistic failures
probabilistic shared risk link group
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFCOM.2009.5062015
