Loading…
Diverse Routing in Networks With Probabilistic Failures
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 att...
Saved in:
Published in: | IEEE/ACM transactions on networking 2010-12, Vol.18 (6), p.1895-1907 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c368t-89ab13f6549fd63d0c69b8c3f6e894da64d2365d06f4eaed1a386c52f704f0793 |
---|---|
cites | cdi_FETCH-LOGICAL-c368t-89ab13f6549fd63d0c69b8c3f6e894da64d2365d06f4eaed1a386c52f704f0793 |
container_end_page | 1907 |
container_issue | 6 |
container_start_page | 1895 |
container_title | IEEE/ACM transactions on networking |
container_volume | 18 |
creator | Hyang-Won Lee Modiano, Eytan Kayi Lee |
description | 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 nonlinear program (INLP) and develop approximations and linear relaxations that can find nearly optimal solutions in most cases. |
doi_str_mv | 10.1109/TNET.2010.2050490 |
format | article |
fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_5473148</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5473148</ieee_id><sourcerecordid>855711351</sourcerecordid><originalsourceid>FETCH-LOGICAL-c368t-89ab13f6549fd63d0c69b8c3f6e894da64d2365d06f4eaed1a386c52f704f0793</originalsourceid><addsrcrecordid>eNpdkE1Lw0AQhhdRsFZ_gHgJePCUOpv9yO5RaqtCqSIVj8smmejWNKm7ieK_N6HFg6f54HmH4SHknMKEUtDXq-VsNUmgHxMQwDUckBEVQsWJkPKw70GyWEqdHJOTENYAlEEiRyS9dV_oA0bPTde6-i1ydbTE9rvxHyF6de179OSbzGaucqF1eTS3ruo8hlNyVNoq4Nm-jsnLfLaa3seLx7uH6c0izplUbay0zSgrpeC6LCQrIJc6U3m_QaV5YSUvEiZFAbLkaLGglimZi6RMgZeQajYmV7u7W998dhhas3Ehx6qyNTZdMEqIlFImaE9e_iPXTefr_jlDgQFVWqcDRXdU7psQPJZm693G-p8eMoNJM5g0g0mzN9lnLnYZh4h_vOApo1yxX_Htbdk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1030189971</pqid></control><display><type>article</type><title>Diverse Routing in Networks With Probabilistic Failures</title><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><source>IEEE Xplore (Online service)</source><creator>Hyang-Won Lee ; Modiano, Eytan ; Kayi Lee</creator><creatorcontrib>Hyang-Won Lee ; Modiano, Eytan ; Kayi Lee</creatorcontrib><description>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 nonlinear program (INLP) and develop approximations and linear relaxations that can find nearly optimal solutions in most cases.</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/TNET.2010.2050490</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Communication networks ; Computer networks ; Correlated failures ; Correlation ; disjoint paths ; Failure ; Government ; Linear approximation ; Links ; Networks ; Optical fiber cables ; Optical fiber communication ; Optical fiber networks ; path protection ; Probabilistic methods ; probabilistic shared risk link group (SRLG) ; Probability theory ; Protection ; random link failures ; Routing ; Routing (telecommunications) ; Telecommunication network reliability ; Telecommunication traffic</subject><ispartof>IEEE/ACM transactions on networking, 2010-12, Vol.18 (6), p.1895-1907</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Dec 2010</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c368t-89ab13f6549fd63d0c69b8c3f6e894da64d2365d06f4eaed1a386c52f704f0793</citedby><cites>FETCH-LOGICAL-c368t-89ab13f6549fd63d0c69b8c3f6e894da64d2365d06f4eaed1a386c52f704f0793</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5473148$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,777,781,27906,27907,54778</link.rule.ids></links><search><creatorcontrib>Hyang-Won Lee</creatorcontrib><creatorcontrib>Modiano, Eytan</creatorcontrib><creatorcontrib>Kayi Lee</creatorcontrib><title>Diverse Routing in Networks With Probabilistic Failures</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>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 nonlinear program (INLP) and develop approximations and linear relaxations that can find nearly optimal solutions in most cases.</description><subject>Algorithms</subject><subject>Communication networks</subject><subject>Computer networks</subject><subject>Correlated failures</subject><subject>Correlation</subject><subject>disjoint paths</subject><subject>Failure</subject><subject>Government</subject><subject>Linear approximation</subject><subject>Links</subject><subject>Networks</subject><subject>Optical fiber cables</subject><subject>Optical fiber communication</subject><subject>Optical fiber networks</subject><subject>path protection</subject><subject>Probabilistic methods</subject><subject>probabilistic shared risk link group (SRLG)</subject><subject>Probability theory</subject><subject>Protection</subject><subject>random link failures</subject><subject>Routing</subject><subject>Routing (telecommunications)</subject><subject>Telecommunication network reliability</subject><subject>Telecommunication traffic</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNpdkE1Lw0AQhhdRsFZ_gHgJePCUOpv9yO5RaqtCqSIVj8smmejWNKm7ieK_N6HFg6f54HmH4SHknMKEUtDXq-VsNUmgHxMQwDUckBEVQsWJkPKw70GyWEqdHJOTENYAlEEiRyS9dV_oA0bPTde6-i1ydbTE9rvxHyF6de179OSbzGaucqF1eTS3ruo8hlNyVNoq4Nm-jsnLfLaa3seLx7uH6c0izplUbay0zSgrpeC6LCQrIJc6U3m_QaV5YSUvEiZFAbLkaLGglimZi6RMgZeQajYmV7u7W998dhhas3Ehx6qyNTZdMEqIlFImaE9e_iPXTefr_jlDgQFVWqcDRXdU7psQPJZm693G-p8eMoNJM5g0g0mzN9lnLnYZh4h_vOApo1yxX_Htbdk</recordid><startdate>20101201</startdate><enddate>20101201</enddate><creator>Hyang-Won Lee</creator><creator>Modiano, Eytan</creator><creator>Kayi Lee</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20101201</creationdate><title>Diverse Routing in Networks With Probabilistic Failures</title><author>Hyang-Won Lee ; Modiano, Eytan ; Kayi Lee</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c368t-89ab13f6549fd63d0c69b8c3f6e894da64d2365d06f4eaed1a386c52f704f0793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithms</topic><topic>Communication networks</topic><topic>Computer networks</topic><topic>Correlated failures</topic><topic>Correlation</topic><topic>disjoint paths</topic><topic>Failure</topic><topic>Government</topic><topic>Linear approximation</topic><topic>Links</topic><topic>Networks</topic><topic>Optical fiber cables</topic><topic>Optical fiber communication</topic><topic>Optical fiber networks</topic><topic>path protection</topic><topic>Probabilistic methods</topic><topic>probabilistic shared risk link group (SRLG)</topic><topic>Probability theory</topic><topic>Protection</topic><topic>random link failures</topic><topic>Routing</topic><topic>Routing (telecommunications)</topic><topic>Telecommunication network reliability</topic><topic>Telecommunication traffic</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hyang-Won Lee</creatorcontrib><creatorcontrib>Modiano, Eytan</creatorcontrib><creatorcontrib>Kayi Lee</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Hyang-Won Lee</au><au>Modiano, Eytan</au><au>Kayi Lee</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Diverse Routing in Networks With Probabilistic Failures</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>2010-12-01</date><risdate>2010</risdate><volume>18</volume><issue>6</issue><spage>1895</spage><epage>1907</epage><pages>1895-1907</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><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 nonlinear program (INLP) and develop approximations and linear relaxations that can find nearly optimal solutions in most cases.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TNET.2010.2050490</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1063-6692 |
ispartof | IEEE/ACM transactions on networking, 2010-12, Vol.18 (6), p.1895-1907 |
issn | 1063-6692 1558-2566 |
language | eng |
recordid | cdi_ieee_primary_5473148 |
source | Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list); IEEE Xplore (Online service) |
subjects | Algorithms Communication networks Computer networks Correlated failures Correlation disjoint paths Failure Government Linear approximation Links Networks Optical fiber cables Optical fiber communication Optical fiber networks path protection Probabilistic methods probabilistic shared risk link group (SRLG) Probability theory Protection random link failures Routing Routing (telecommunications) Telecommunication network reliability Telecommunication traffic |
title | Diverse Routing in Networks With Probabilistic Failures |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T09%3A29%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Diverse%20Routing%20in%20Networks%20With%20Probabilistic%20Failures&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Hyang-Won%20Lee&rft.date=2010-12-01&rft.volume=18&rft.issue=6&rft.spage=1895&rft.epage=1907&rft.pages=1895-1907&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/TNET.2010.2050490&rft_dat=%3Cproquest_ieee_%3E855711351%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c368t-89ab13f6549fd63d0c69b8c3f6e894da64d2365d06f4eaed1a386c52f704f0793%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1030189971&rft_id=info:pmid/&rft_ieee_id=5473148&rfr_iscdi=true |