A Polynomial-Time Algorithm for Computing Disjoint Lightpath Pairs in Minimum Isolated-Failure-Immune WDM Optical Networks

A fundamental problem in survivable routing in wavelength division multiplexing (WDM) optical networks is the computation of a pair of link-disjoint (or node-disjoint) lightpaths connecting a source with a destination, subject to the wavelength continuity constraint. However, this problem is NP-hard...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on networking Jg. 22; H. 2; S. 470 - 483
Hauptverfasser:	Xue, Guoliang, Gottapu, Ravi, Fang, Xi, Yang, Dejun, Thulasiraman, Krishnaiyan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.04.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Computation Computer networks Disjoint lightpath pairs Fiber optic networks Heuristic algorithms Integer linear programming Linear programming Mathematical models Mesh networks minimum isolated failure immune networks Network topology Networks Optical communication Optical fiber networks partial 2-trees Protection Routing Scalability Topology Wave division multiplexing Wavelength division multiplexing wavelength division multiplexing (WDM) optical network Wavelengths WDM networks
ISSN:	1063-6692, 1558-2566
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	A fundamental problem in survivable routing in wavelength division multiplexing (WDM) optical networks is the computation of a pair of link-disjoint (or node-disjoint) lightpaths connecting a source with a destination, subject to the wavelength continuity constraint. However, this problem is NP-hard when the underlying network topology is a general mesh network. As a result, heuristic algorithms and integer linear programming (ILP) formulations for solving this problem have been proposed. In this paper, we advocate the use of 2-edge connected (or 2-node connected) subgraphs of minimum isolated failure immune networks as the underlying topology for WDM optical networks. We present a polynomial-time algorithm for computing a pair of link-disjoint lightpaths with shortest total length in such networks. The running time of our algorithm is O(nW^{2}) , where n is the number of nodes, and W is the number of wavelengths per link. Numerical results are presented to demonstrate the effectiveness and scalability of our algorithm. Extension of our algorithm to the node-disjoint case is straightforward.
AbstractList	A fundamental problem in survivable routing in wavelength division multiplexing (WDM) optical networks is the computation of a pair of link-disjoint (or node-disjoint) lightpaths connecting a source with a destination, subject to the wavelength continuity constraint. However, this problem is NP-hard when the underlying network topology is a general mesh network. As a result, heuristic algorithms and integer linear programming (ILP) formulations for solving this problem have been proposed. In this paper, we advocate the use of 2-edge connected (or 2-node connected) subgraphs of minimum isolated failure immune networks as the underlying topology for WDM optical networks. We present a polynomial-time algorithm for computing a pair of link-disjoint lightpaths with shortest total length in such networks. The running time of our algorithm is O openbracket nW 2 [ closebracket ] , where n is the number of nodes, and W is the number of wavelengths per link. Numerical results are presented to demonstrate the effectiveness and scalability of our algorithm. Extension of our algorithm to the node-disjoint case is straightforward. A fundamental problem in survivable routing in wavelength division multiplexing (WDM) optical networks is the computation of a pair of link-disjoint (or node-disjoint) lightpaths connecting a source with a destination, subject to the wavelength continuity constraint. However, this problem is NP-hard when the underlying network topology is a general mesh network. As a result, heuristic algorithms and integer linear programming (ILP) formulations for solving this problem have been proposed. In this paper, we advocate the use of 2-edge connected (or 2-node connected) subgraphs of minimum isolated failure immune networks as the underlying topology for WDM optical networks. We present a polynomial-time algorithm for computing a pair of link-disjoint lightpaths with shortest total length in such networks. The running time of our algorithm is O(nW^{2}) , where n is the number of nodes, and W is the number of wavelengths per link. Numerical results are presented to demonstrate the effectiveness and scalability of our algorithm. Extension of our algorithm to the node-disjoint case is straightforward. A fundamental problem in survivable routing in wavelength division multiplexing (WDM) optical networks is the computation of a pair of link-disjoint (or node-disjoint) lightpaths connecting a source with a destination, subject to the wavelength continuity constraint. However, this problem is NP-hard when the underlying network topology is a general mesh network. As a result, heuristic algorithms and integer linear programming (ILP) formulations for solving this problem have been proposed. In this paper, we advocate the use of 2-edge connected (or 2-node connected) subgraphs of minimum isolated failure immune networks as the underlying topology for WDM optical networks. We present a polynomial-time algorithm for computing a pair of link-disjoint lightpaths with shortest total length in such networks. The running time of our algorithm is [Formula Omitted], where [Formula Omitted] is the number of nodes, and [Formula Omitted] is the number of wavelengths per link. Numerical results are presented to demonstrate the effectiveness and scalability of our algorithm. Extension of our algorithm to the node-disjoint case is straightforward.
Author	Fang, Xi Thulasiraman, Krishnaiyan Gottapu, Ravi Xue, Guoliang Yang, Dejun
Author_xml	– sequence: 1 givenname: Guoliang surname: Xue fullname: Xue, Guoliang email: xue@asu.edu organization: Arizona State University, Tempe – sequence: 2 givenname: Ravi surname: Gottapu fullname: Gottapu, Ravi organization: Amazon, Inc., Seattle – sequence: 3 givenname: Xi surname: Fang fullname: Fang, Xi organization: Arizona State University, Tempe – sequence: 4 givenname: Dejun surname: Yang fullname: Yang, Dejun organization: Arizona State University, Tempe – sequence: 5 givenname: Krishnaiyan surname: Thulasiraman fullname: Thulasiraman, Krishnaiyan organization: University of Oklahoma, Norman
BookMark	eNp9kTlvGzEQRheBA8RHfkCQhkCaNKvwEK9SkO1EgHwUClIS9HooUVmSG5ILw_n1WUFGCheuZor3ZgbznTUnMUVomk8EzwjB-tvm9mozo5iwGaVcEoXfNaeEc9VSLsTJ1GPBWiE0_dCclbLHE4mpOG3-LtB96p9jCt727cYHQIt-m7Kvu4BcymiZwjBWH7fo0pd98rGitd_u6mDrDt1bnwvyEd346MMY0Kqk3lZ4bK-t78cM7SqEMQL6dXmD7obqO9ujW6hPKf8uF817Z_sCH1_qefPz-mqz_NGu776vlot12zEqaiskBazIg6ZurpiDTlDMNcNAMIDD1Do-J8AeJJfaYcmkBj7RTgLTXOFHdt58Pc4dcvozQqkm-NJB39sIaSyGTAOxVpLwCf3yCt2nMcfpOkP4nCulOJ9PFDlSXU6lZHBmyD7Y_GwINoc0zCENc0jDvKQxOfKV0_lqq0-x5ulVb5qfj6YHgP-bBCeaKs3-Afg1mSo
CODEN	IEANEP
CitedBy_id	crossref_primary_10_1109_TNET_2017_2747588
Cites_doi	10.1109/90.803380 10.1109/INFCOM.2001.916719 10.1109/90.879346 10.1016/0012-365X(74)90042-9 10.1016/j.comnet.2004.10.013 10.1109/JSAC.2002.1003045 10.1109/71.342122 10.1007/BF02110142 10.1109/49.265708 10.1109/26.153361 10.1109/TNET.2008.919323 10.1109/TNET.2005.852879 10.1109/JSAC.2003.816597 10.1109/TCOMM.2003.809779 10.1109/INFCOM.2004.1354524 10.1002/net.3230040204 10.1109/JSAC.2007.070606 10.1002/net.3230130202 10.1109/90.917075 10.1109/TNET.2009.2036911 10.1016/j.comnet.2008.04.017 10.1007/978-1-4757-3171-2_9 10.1109/TNET.2007.900705 10.1109/INFCOM.1999.751461 10.1109/49.887904 10.1109/INFCOM.2007.81 10.1109/INFOCOM.2008.45 10.1002/net.3230110304 10.1109/90.986592 10.1109/TNET.2007.893884 10.1109/4234.917104 10.1109/TNET.2010.2044514 10.1007/978-3-7091-6247-7 10.1109/INFCOM.2002.1019327 10.1109/INFCOM.2009.5062014
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2014
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Apr 2014
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3
DOI	10.1109/TNET.2013.2257180
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE/IET Electronic Library (IEL) (UW System Shared) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Technology Research Database Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1558-2566
EndPage	483
ExternalDocumentID	3377115491 10_1109_TNET_2013_2257180 6519289
Genre	orig-research
GrantInformation_xml	– fundername: ARO grantid: W911NF-09-1-0467 – fundername: NSF grantid: 0830739; 1115129; 1115130
GroupedDBID	-DZ -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 85S 8US 97E 9M8 AAJGR AAKMM AALFJ AARMG AASAJ AAWTH AAWTV ABAZT ABPPZ ABQJQ ABVLG ACGFS ACGOD ACIWK ACM ADBCU ADL AEBYY AEFXT AEJOY AENSD AETEA AETIX AFWIH AFWXC AGQYO AGSQL AHBIQ AI. AIBXA AIKLT AKJIK AKQYR AKRVB ALLEH ALMA_UNASSIGNED_HOLDINGS ATWAV BDXCO BEFXN BFFAM BGNUA BKEBE BPEOZ CCLIF CS3 D0L EBS EJD FEDTE GUFHI HF~ HGAVV HZ~ H~9 I07 ICLAB IEDLZ IES IFIPE IFJZH IPLJI JAVBF LAI LHSKQ M43 MVM O9- OCL P1C P2P PQQKQ RIA RIE RNS ROL TN5 UPT UQL VH1 XOL YR2 ZCA AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3
ID	FETCH-LOGICAL-c326t-672e081b92f483fec6205930e10eef02af541e3b7579f07379e51b9f7e39580d3
IEDL.DBID	RIE
ISICitedReferencesCount	1
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000335821100010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1063-6692
IngestDate	Sun Nov 09 09:38:07 EST 2025 Sun Nov 30 05:29:39 EST 2025 Sat Nov 29 07:44:54 EST 2025 Tue Nov 18 22:37:42 EST 2025 Wed Aug 27 02:13:17 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	2
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c326t-672e081b92f483fec6205930e10eef02af541e3b7579f07379e51b9f7e39580d3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23
PQID	1545888554
PQPubID	32020
PageCount	14
ParticipantIDs	proquest_journals_1545888554 crossref_primary_10_1109_TNET_2013_2257180 proquest_miscellaneous_1620098715 crossref_citationtrail_10_1109_TNET_2013_2257180 ieee_primary_6519289
PublicationCentury	2000
PublicationDate	2014-04-01
PublicationDateYYYYMMDD	2014-04-01
PublicationDate_xml	– month: 04 year: 2014 text: 2014-04-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE/ACM transactions on networking
PublicationTitleAbbrev	TNET
PublicationYear	2014
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref35 ref13 west (ref34) 1996 ref15 ramaswami (ref26) 1998 ref36 ref14 ref31 ref30 ref33 ref11 ref32 ref10 ref1 ref39 ref17 ref38 ref16 ref19 ref18 ref23 ref25 ref20 ref22 ref21 zhang (ref37) 2008; 16 ref27 ref29 ref8 hu (ref12) 2003; 51 ref7 ref9 ref4 ref3 she (ref28) 2010; 18 ref6 ref5 anand (ref2) 2001; 10 qiao (ref24) 2002
References_xml	– ident: ref21 doi: 10.1109/90.803380 – ident: ref19 doi: 10.1109/INFCOM.2001.916719 – ident: ref4 doi: 10.1109/90.879346 – ident: ref27 doi: 10.1016/0012-365X(74)90042-9 – start-page: 302 year: 2002 ident: ref24 article-title: Distributed partial information management (DPIM) schemes for survivable networks?Part I publication-title: Proc IEEE InfoCom – ident: ref36 doi: 10.1016/j.comnet.2004.10.013 – ident: ref22 doi: 10.1109/JSAC.2002.1003045 – ident: ref38 doi: 10.1109/71.342122 – ident: ref6 doi: 10.1007/BF02110142 – ident: ref11 doi: 10.1109/49.265708 – ident: ref7 doi: 10.1109/26.153361 – ident: ref14 doi: 10.1109/TNET.2008.919323 – ident: ref29 doi: 10.1109/TNET.2005.852879 – ident: ref35 doi: 10.1109/JSAC.2003.816597 – volume: 51 start-page: 489 year: 2003 ident: ref12 article-title: Diverse routing in optical mesh networks publication-title: IEEE Trans Commun doi: 10.1109/TCOMM.2003.809779 – ident: ref3 doi: 10.1109/INFCOM.2004.1354524 – ident: ref30 doi: 10.1002/net.3230040204 – ident: ref17 doi: 10.1109/JSAC.2007.070606 – ident: ref33 doi: 10.1002/net.3230130202 – ident: ref16 doi: 10.1109/90.917075 – volume: 18 start-page: 922 year: 2010 ident: ref28 article-title: How reliable can two-path protection be? publication-title: IEEE/ACM Trans Netw doi: 10.1109/TNET.2009.2036911 – year: 1998 ident: ref26 publication-title: Optical Networks A Practical Perspective – ident: ref10 doi: 10.1016/j.comnet.2008.04.017 – ident: ref9 doi: 10.1007/978-1-4757-3171-2_9 – volume: 16 start-page: 642 year: 2008 ident: ref37 article-title: Faster algorithms for construction of recovery trees enhancing QoP and QoS publication-title: IEEE/ACM Trans Netw doi: 10.1109/TNET.2007.900705 – ident: ref25 doi: 10.1109/INFCOM.1999.751461 – ident: ref23 doi: 10.1109/49.887904 – year: 1996 ident: ref34 publication-title: Introduction to Graph Theory – ident: ref32 doi: 10.1109/INFCOM.2007.81 – ident: ref1 doi: 10.1109/INFOCOM.2008.45 – ident: ref13 doi: 10.1002/net.3230110304 – ident: ref20 doi: 10.1109/90.986592 – volume: 10 start-page: 317 year: 2001 ident: ref2 article-title: Static versus dynamic establishment of protection paths in WDM networks publication-title: J High Speed Netw – ident: ref5 doi: 10.1109/TNET.2007.893884 – ident: ref18 doi: 10.1109/4234.917104 – ident: ref39 doi: 10.1109/TNET.2010.2044514 – ident: ref15 doi: 10.1007/978-3-7091-6247-7 – ident: ref8 doi: 10.1109/INFCOM.2002.1019327 – ident: ref31 doi: 10.1109/INFCOM.2009.5062014
SSID	ssj0013026
Score	2.0915854
Snippet	A fundamental problem in survivable routing in wavelength division multiplexing (WDM) optical networks is the computation of a pair of link-disjoint (or...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	470
SubjectTerms	Algorithms Computation Computer networks Disjoint lightpath pairs Fiber optic networks Heuristic algorithms Integer linear programming Linear programming Mathematical models Mesh networks minimum isolated failure immune networks Network topology Networks Optical communication Optical fiber networks partial 2-trees Protection Routing Scalability Topology Wave division multiplexing Wavelength division multiplexing wavelength division multiplexing (WDM) optical network Wavelengths WDM networks
Title	A Polynomial-Time Algorithm for Computing Disjoint Lightpath Pairs in Minimum Isolated-Failure-Immune WDM Optical Networks
URI	https://ieeexplore.ieee.org/document/6519289 https://www.proquest.com/docview/1545888554 https://www.proquest.com/docview/1620098715
Volume	22
WOSCitedRecordID	wos000335821100010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2566 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0013026 issn: 1063-6692 databaseCode: RIE dateStart: 19930101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwELbaigMceBXEQkFG4oRw640dJz6uaFdUosseFtFblNjjErSbVLtZJPj1zDjpAgIhcYuUyUP-_JjPM-OPsVdJcKEEF4SunBHaI0EpE1DC6VAZwBUoDzqKTWSzWX55aed77M2uFgYAYvIZHNNljOX71m1pq-zEoLuBBGGf7WeZ6Wu1fkYMZJRWQ4ajhDE2GSKYY2lPFrOzBSVxqWPsvDgXy9_WoCiq8sdMHJeX6b3_-7H77O7gRvJJj_sDtgfNQ3bnl8MFD9n3CZ-3y29UdlwuBZV68Mnyql3X3ecVR1eV94IOaMtP682Xtm46_p6oOokU8znFeXjd8Iu6qVfbFT_HTop-qRfTsqZUdnFOlSXAP51e8A_XcUecz_qc8s0j9nF6tnj7TgxKC8Kh-9YJkyWAvkFlk6BzFcCZhKT-JIwlQJBJGVI9BlVlaWYDTgqZhRStQwbKprn06jE7aNoGnjCukKHpqvQJeKM9qNLlrsorVWnrrfN2xORN2xduOIac1DCWRaQj0hYEV0FwFQNcI_Z698h1fwbHv4wPCZ-d4QDNiB3dAFwMo3RTxKhhTol6I_ZydxvHFwVNygbaLdoYih8hrUyf_v3Nz9ht_P6QzXPEDrr1Fp6zW-5rV2_WL2In_QH58-Xz
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9NAEB6VgkQ58CoVoQUWiRNiW8fr1x4j2qgRickhiN4sez0LRoldJQ4S_PrObNzQCoTEzZJnrZVnH_PtN7MfwFvfGpujsTIoTCSDkgBK7qOSJrBFhLQDJTZwYhNxmiYXF3q6A--3tTCI6JLP8JgfHZdfNmbNR2UnEYUbBBDuwF1WzuqqtX5zBp4TVyOMo2QUab_jMPuePpmlZzNO41LHNHxpNfZu7UJOVuWPtdhtMMNH_9e1x_CwCyTFYOP5J7CD9VN4cON6wX34NRDTZv6TC4_zueRiDzGYf22WVfttIShYFRtJB7IVp9Xqe1PVrRgzWGeZYjFlpkdUtZhUdbVYL8SIhilFpqUc5hUns8sR15ag-HI6EZ8u3Zm4SDdZ5atn8Hl4NvtwLjutBWkogGtlFPtI0UGhfRskyqKJfBb787DvIVrPz20Y9FEVcRhrS8tCrDEkaxuj0mHileoAduumxucgFGG0oMhLH8soKFHlJjFFUqgi0KU2pe6Bd_3vM9NdRM56GPPMARJPZ-yujN2Vde7qwbttk8vNLRz_Mt5n_2wNO9f04OjawVk3T1eZ4w0TTtXrwZvta5phTJvkNTZrsomYQSJgGb74-5dfw_3z2WScjUfpx0PYo750uT1HsNsu1_gS7pkfbbVavnID9goZqOk8
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Polynomial-Time+Algorithm+for+Computing+Disjoint+Lightpath+Pairs+in+Minimum+Isolated-Failure-Immune+WDM+Optical+Networks&rft.jtitle=IEEE%2FACM+transactions+on+networking&rft.au=Xue%2C+Guoliang&rft.au=Gottapu%2C+Ravi&rft.au=Fang%2C+Xi&rft.au=Yang%2C+Dejun&rft.date=2014-04-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=1063-6692&rft.eissn=1558-2566&rft.volume=22&rft.issue=2&rft.spage=470&rft_id=info:doi/10.1109%2FTNET.2013.2257180&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=3377115491
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1063-6692&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1063-6692&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1063-6692&client=summon