On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks

In multi-channel wireless networks, a fundamental problem is to find node-disjoint paths minimising global cost or the maximum individual path cost, under the constraint that each path operates on a separate channel to maximise the fault tolerance and robustness against channel instability and malic...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 695; pp. 74 - 82
Main Authors:	Zhang, Shurong, Chen, Lin, Yang, Weihua
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 26.09.2017 Elsevier
Subjects:	Computer Science Fully polynomial-time approximation algorithms Multi-channel wireless networks Vertex- and channel-disjoint paths Multi-channel wireless networks Vertex- and channel-disjoint paths Fully polynomial-time approximation algorithms
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	In multi-channel wireless networks, a fundamental problem is to find node-disjoint paths minimising global cost or the maximum individual path cost, under the constraint that each path operates on a separate channel to maximise the fault tolerance and robustness against channel instability and malicious attacks. Meanwhile, the quality of service (QoS) requirement (e.g., in terms of end-to-end delay) needs to be satisfied on each path. In this paper, we provide a comprehensive formulation and analysis on this multi-path optimization problem by casting it to the problem k-disjoint path with different colours (k-DPDC). We further formulate the Restricted MinSum k-DPDC and Restricted MinMax k-DPDC to denote the problems of finding multiple node- and channel-disjoint paths minimising the global cost and the maximum individual path cost under the QoS constraint on the path end-to-end delay. Given the NP-hardness of both problems, we focus on directed acyclic graphs and propose fully polynomial-time approximation algorithms for both problems. •We maximise the fault tolerance and robustness against channel instability.•We aim at how to seek node- and channel-disjoint paths satisfying the QoS constraint.•We consider two performance metrics, the sum and the maximum cost of the paths.•In a DAG, we propose fully polynomial-time approximation algorithms for the problems.
AbstractList	In multi-channel wireless networks, a fundamental problem is to find node-disjoint paths minimising global cost or the maximum individual path cost, under the constraint that each path operates on a separate channel to maximise the fault tolerance and robustness against channel instability and malicious attacks. Meanwhile, the quality of service (QoS) requirement (e.g., in terms of end-to-end delay) needs to be satisfied on each path. In this paper, we provide a comprehensive formulation and analysis on this multi-path optimization problem by casting it to the problem k-disjoint path with different colours (k-DPDC). We further formulate the Restricted MinSum k-DPDC and Restricted MinMax k-DPDC to denote the problems of finding multiple node- and channel-disjoint paths minimising the global cost and the maximum individual path cost under the QoS constraint on the path end-to-end delay. Given the NP-hardness of both problems, we focus on directed acyclic graphs and propose fully polynomial-time approximation algorithms for both problems. •We maximise the fault tolerance and robustness against channel instability.•We aim at how to seek node- and channel-disjoint paths satisfying the QoS constraint.•We consider two performance metrics, the sum and the maximum cost of the paths.•In a DAG, we propose fully polynomial-time approximation algorithms for the problems. In multi-channel wireless networks, a fundamental problem is to find node-disjoint paths minimising global cost or the maximum individual path cost, under the constraint that each path operates on a separate channel to maximise the fault tolerance and robustness against channel instability and malicious attacks. Meanwhile, the quality of service (QoS) requirement (e.g., in terms of end-to-end delay) needs to be satisfied on each path. In this paper, we provide a comprehensive formulation and analysis on this multi-path optimization problem by casting it to the problem k-disjoint path with different colours (k-DPDC). We further formulate the Restricted MinSum k-DPDC and Restricted MinMax k-DPDC to denote the problems of finding multiple node- and channel-disjoint paths minimising the global cost and the maximum individual path cost under the QoS constraint on the path end-to-end delay. Given the NP-hardness of both problems, we focus on directed acyclic graphs and propose fully polynomial-time approximation algorithms for both problems.
Author	Yang, Weihua Zhang, Shurong Chen, Lin
Author_xml	– sequence: 1 givenname: Shurong orcidid: 0000-0002-0452-7761 surname: Zhang fullname: Zhang, Shurong email: shurongmm@163.com organization: College of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi 030024, China – sequence: 2 givenname: Lin surname: Chen fullname: Chen, Lin organization: Lab. Recherche Informatique (LRI-CNRS UMR 8623), Univ. Paris-Sud, 91405 Orsay, France – sequence: 3 givenname: Weihua surname: Yang fullname: Yang, Weihua organization: College of Mathematics, Taiyuan University of Technology, Taiyuan, Shanxi 030024, China
BackLink	https://inria.hal.science/hal-01618077$$DView record in HAL
BookMark	eNp9kE1LAzEQhoNUsK3-AG-5etg1yX6ki6dS1AqFIurJQ8hmZ2nqNilJ2qK_3qwVDx46DAwM7zMwzwgNjDWA0DUlKSW0vF2nQfmUEcpTEpvxMzSkE14ljFX5AA1JRvIkq3hxgUber0msgpdD9L40uJW7LiTBduCkCXgrwwrbbdAb_SWDtgbvTAMOP9sXrKzxwUkdY9rgTeR0olbSGOjwQTvowHtsIBys-_CX6LyVnYer3zlGbw_3r7N5slg-Ps2mi0RlGQ1Jw2ulVE6zjHEpgZZtW5Mib6t8AkTyIq9rApNKNQ2r85oR4Fkta06KVraSlSwbo5vj3ZXsxNbpjXSfwkot5tOF6HdREJ0Qzvc0Zukxq5z13kH7B1AiepNiLaJJ0ZsUJDbjkeH_GKXDj5leRXeSvDuSEN_fa3DCKw1GQRNdqSAaq0_Q3wEtkkM
CitedBy_id	crossref_primary_10_1016_j_tcs_2021_08_009
Cites_doi	10.1002/net.3230140405 10.1287/moor.17.1.36 10.1007/BF02125897 10.1002/net.3230040204 10.1287/opre.35.1.70 10.1016/S0020-0190(02)00205-3 10.1287/opre.25.6.920 10.1016/S0167-6377(01)00069-4 10.1145/322047.322048 10.1002/net.3230120306 10.1145/321921.321934 10.1016/j.jcss.2010.08.012 10.1145/321906.321909 10.1016/0166-218X(90)90024-7 10.1016/j.jcss.2010.01.013 10.1287/moor.4.4.339
ContentType	Journal Article
Copyright	2017 Elsevier B.V. Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: 2017 Elsevier B.V. – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID	AAYXX CITATION 1XC
DOI	10.1016/j.tcs.2017.07.027
DatabaseName	CrossRef Hyper Article en Ligne (HAL)
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Mathematics Computer Science
EISSN	1879-2294
EndPage	82
ExternalDocumentID	oai:HAL:hal-01618077v1 10_1016_j_tcs_2017_07_027 S0304397517305753
GrantInformation_xml	– fundername: National Natural Science Foundation of China grantid: 61502330; 11671296 funderid: https://doi.org/10.13039/501100001809
GroupedDBID	--K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AEXQZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW SSZ T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FGOYB G-2 HZ~ R2- SEW TAE WUQ ZY4 ~HD 1XC
ID	FETCH-LOGICAL-c331t-d7bccc413327aae16ffb054f948e0a754bb0e89cdd2b4b20e73bab705fafa2623
ISICitedReferencesCount	4
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000412260800006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0304-3975
IngestDate	Sat Nov 29 15:02:11 EST 2025 Sat Nov 29 05:15:27 EST 2025 Tue Nov 18 20:45:15 EST 2025 Fri Feb 23 02:30:25 EST 2024
IsPeerReviewed	true
IsScholarly	true
Keywords	Multi-channel wireless networks Vertex- and channel-disjoint paths Fully polynomial-time approximation algorithms
Language	English
License	Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c331t-d7bccc413327aae16ffb054f948e0a754bb0e89cdd2b4b20e73bab705fafa2623
ORCID	0000-0002-0452-7761 0000-0001-7943-3172
PageCount	9
ParticipantIDs	hal_primary_oai_HAL_hal_01618077v1 crossref_primary_10_1016_j_tcs_2017_07_027 crossref_citationtrail_10_1016_j_tcs_2017_07_027 elsevier_sciencedirect_doi_10_1016_j_tcs_2017_07_027
PublicationCentury	2000
PublicationDate	2017-09-26
PublicationDateYYYYMMDD	2017-09-26
PublicationDate_xml	– month: 09 year: 2017 text: 2017-09-26 day: 26
PublicationDecade	2010
PublicationTitle	Theoretical computer science
PublicationYear	2017
Publisher	Elsevier B.V Elsevier
Publisher_xml	– name: Elsevier B.V – name: Elsevier
References	Itai, Perl, Shiloach (br0080) 1982; 12 Garey, Johnson (br0050) 1979 Wu (br0190) 2011; 77 Ibarra, Kim (br0070) 1975; 22 Sahni (br0160) 1976; 23 Lawler (br0090) 1979; 4 Peleg, Upfal (br0130) 1989; 9 Sahni (br0170) 1977; 25 Ergun, Sinha, Zhang (br0030) 2002; 83 Hassin (br0060) 1992; 17 Yu, Lin, Wang (br0200) 2010; 76 Bondy, Murty (br0010) 2007 Bang-Jensen, Gutin (br0020) 2007 Lorenz, Raz (br0110) 2001; 28 Perl, Shiloach (br0120) 1978; 25 Ronen, Perl (br0140) 1984; 14 Warburton (br0180) 1987; 35 Fleischer, Ge, Li, Zhu (br0040) 2007 Li, McCormick, Simchi-Levi (br0100) 1990; 26 Suuballe (br0150) 1974; 4 Garey (10.1016/j.tcs.2017.07.027_br0050) 1979 Warburton (10.1016/j.tcs.2017.07.027_br0180) 1987; 35 Perl (10.1016/j.tcs.2017.07.027_br0120) 1978; 25 Ronen (10.1016/j.tcs.2017.07.027_br0140) 1984; 14 Li (10.1016/j.tcs.2017.07.027_br0100) 1990; 26 Fleischer (10.1016/j.tcs.2017.07.027_br0040) 2007 Ibarra (10.1016/j.tcs.2017.07.027_br0070) 1975; 22 Bondy (10.1016/j.tcs.2017.07.027_br0010) 2007 Ergun (10.1016/j.tcs.2017.07.027_br0030) 2002; 83 Peleg (10.1016/j.tcs.2017.07.027_br0130) 1989; 9 Yu (10.1016/j.tcs.2017.07.027_br0200) 2010; 76 Itai (10.1016/j.tcs.2017.07.027_br0080) 1982; 12 Wu (10.1016/j.tcs.2017.07.027_br0190) 2011; 77 Lawler (10.1016/j.tcs.2017.07.027_br0090) 1979; 4 Lorenz (10.1016/j.tcs.2017.07.027_br0110) 2001; 28 Sahni (10.1016/j.tcs.2017.07.027_br0160) 1976; 23 Bang-Jensen (10.1016/j.tcs.2017.07.027_br0020) 2007 Hassin (10.1016/j.tcs.2017.07.027_br0060) 1992; 17 Suuballe (10.1016/j.tcs.2017.07.027_br0150) 1974; 4 Sahni (10.1016/j.tcs.2017.07.027_br0170) 1977; 25
References_xml	– volume: 9 start-page: 289 year: 1989 end-page: 313 ident: br0130 article-title: Constructing disjoint paths on expander graphs publication-title: Combinatorica – volume: 14 start-page: 531 year: 1984 end-page: 544 ident: br0140 article-title: Heuristics for finding a maximum number of disjoint bounded paths publication-title: Networks – year: 2007 ident: br0010 article-title: Graph Theory – volume: 28 start-page: 213 year: 2001 end-page: 219 ident: br0110 article-title: A simple efficient approximation scheme for the restricted shortest path problem publication-title: Oper. Res. Lett. – volume: 26 start-page: 105 year: 1990 end-page: 115 ident: br0100 article-title: The complexity of finding two disjoint paths with Min–Max objective function publication-title: Discrete Appl. Math. – volume: 22 start-page: 463 year: 1975 end-page: 468 ident: br0070 article-title: Fast approximation algorithms for the knapsack and sum of subset problems publication-title: J. Assoc. Comput. Mach. – volume: 23 start-page: 116 year: 1976 end-page: 127 ident: br0160 article-title: Algorithms for scheduling independent tasks publication-title: J. ACM – volume: 4 start-page: 125 year: 1974 end-page: 145 ident: br0150 article-title: Disjoint paths in a network publication-title: Networks – volume: 25 start-page: 920 year: 1977 end-page: 936 ident: br0170 article-title: General techniques for combinatorial approximation publication-title: Oper. Res. – volume: 35 start-page: 70 year: 1987 end-page: 79 ident: br0180 article-title: Approximation of Pareto optima in multiple-objective shortest path problems publication-title: Oper. Res. – volume: 83 start-page: 287 year: 2002 end-page: 291 ident: br0030 article-title: An improved FPTAS for restricted shortest path publication-title: Inform. Process. Lett. – volume: 17 start-page: 36 year: 1992 end-page: 42 ident: br0060 article-title: Approximation schemes for the restricted shortest path problem publication-title: Math. Oper. Res. – year: 2007 ident: br0020 article-title: Digraphs Theory, Algorithms and Applications – volume: 77 start-page: 1054 year: 2011 end-page: 1057 ident: br0190 article-title: A note on approximating the min-max vertex disjoint paths on directed acyclic graphs publication-title: J. Comput. System Sci. – start-page: 134 year: 2007 end-page: 143 ident: br0040 article-title: Efficient algorithms for publication-title: Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management – volume: 25 start-page: 1 year: 1978 end-page: 9 ident: br0120 article-title: Finding two disjoint paths between two pairs of vertices in a graph publication-title: J. ACM – volume: 12 start-page: 277 year: 1982 end-page: 286 ident: br0080 article-title: The complexity of finding maximum disjoint paths with length constraints publication-title: Networks – volume: 76 start-page: 697 year: 2010 end-page: 708 ident: br0200 article-title: Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax publication-title: J. Comput. System Sci. – volume: 4 start-page: 339 year: 1979 end-page: 356 ident: br0090 article-title: Fast approximation algorithms for knapsack problems publication-title: Math. Oper. Res. – year: 1979 ident: br0050 article-title: Computers and Intractability: A Guide to the Theory of NP-Completeness – year: 2007 ident: 10.1016/j.tcs.2017.07.027_br0010 – volume: 14 start-page: 531 issue: 4 year: 1984 ident: 10.1016/j.tcs.2017.07.027_br0140 article-title: Heuristics for finding a maximum number of disjoint bounded paths publication-title: Networks doi: 10.1002/net.3230140405 – start-page: 134 year: 2007 ident: 10.1016/j.tcs.2017.07.027_br0040 article-title: Efficient algorithms for k-disjoint paths problems on DAGs – volume: 17 start-page: 36 issue: 1 year: 1992 ident: 10.1016/j.tcs.2017.07.027_br0060 article-title: Approximation schemes for the restricted shortest path problem publication-title: Math. Oper. Res. doi: 10.1287/moor.17.1.36 – volume: 9 start-page: 289 issue: 3 year: 1989 ident: 10.1016/j.tcs.2017.07.027_br0130 article-title: Constructing disjoint paths on expander graphs publication-title: Combinatorica doi: 10.1007/BF02125897 – volume: 4 start-page: 125 issue: 2 year: 1974 ident: 10.1016/j.tcs.2017.07.027_br0150 article-title: Disjoint paths in a network publication-title: Networks doi: 10.1002/net.3230040204 – year: 1979 ident: 10.1016/j.tcs.2017.07.027_br0050 – volume: 35 start-page: 70 year: 1987 ident: 10.1016/j.tcs.2017.07.027_br0180 article-title: Approximation of Pareto optima in multiple-objective shortest path problems publication-title: Oper. Res. doi: 10.1287/opre.35.1.70 – volume: 83 start-page: 287 year: 2002 ident: 10.1016/j.tcs.2017.07.027_br0030 article-title: An improved FPTAS for restricted shortest path publication-title: Inform. Process. Lett. doi: 10.1016/S0020-0190(02)00205-3 – volume: 25 start-page: 920 issue: 6 year: 1977 ident: 10.1016/j.tcs.2017.07.027_br0170 article-title: General techniques for combinatorial approximation publication-title: Oper. Res. doi: 10.1287/opre.25.6.920 – volume: 28 start-page: 213 year: 2001 ident: 10.1016/j.tcs.2017.07.027_br0110 article-title: A simple efficient approximation scheme for the restricted shortest path problem publication-title: Oper. Res. Lett. doi: 10.1016/S0167-6377(01)00069-4 – volume: 25 start-page: 1 issue: 1 year: 1978 ident: 10.1016/j.tcs.2017.07.027_br0120 article-title: Finding two disjoint paths between two pairs of vertices in a graph publication-title: J. ACM doi: 10.1145/322047.322048 – year: 2007 ident: 10.1016/j.tcs.2017.07.027_br0020 – volume: 12 start-page: 277 issue: 3 year: 1982 ident: 10.1016/j.tcs.2017.07.027_br0080 article-title: The complexity of finding maximum disjoint paths with length constraints publication-title: Networks doi: 10.1002/net.3230120306 – volume: 23 start-page: 116 year: 1976 ident: 10.1016/j.tcs.2017.07.027_br0160 article-title: Algorithms for scheduling independent tasks publication-title: J. ACM doi: 10.1145/321921.321934 – volume: 77 start-page: 1054 issue: 6 year: 2011 ident: 10.1016/j.tcs.2017.07.027_br0190 article-title: A note on approximating the min-max vertex disjoint paths on directed acyclic graphs publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2010.08.012 – volume: 22 start-page: 463 issue: 4 year: 1975 ident: 10.1016/j.tcs.2017.07.027_br0070 article-title: Fast approximation algorithms for the knapsack and sum of subset problems publication-title: J. Assoc. Comput. Mach. doi: 10.1145/321906.321909 – volume: 26 start-page: 105 issue: 1 year: 1990 ident: 10.1016/j.tcs.2017.07.027_br0100 article-title: The complexity of finding two disjoint paths with Min–Max objective function publication-title: Discrete Appl. Math. doi: 10.1016/0166-218X(90)90024-7 – volume: 76 start-page: 697 issue: 8 year: 2010 ident: 10.1016/j.tcs.2017.07.027_br0200 article-title: Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph publication-title: J. Comput. System Sci. doi: 10.1016/j.jcss.2010.01.013 – volume: 4 start-page: 339 issue: 4 year: 1979 ident: 10.1016/j.tcs.2017.07.027_br0090 article-title: Fast approximation algorithms for knapsack problems publication-title: Math. Oper. Res. doi: 10.1287/moor.4.4.339
SSID	ssj0000576
Score	2.2119546
Snippet	In multi-channel wireless networks, a fundamental problem is to find node-disjoint paths minimising global cost or the maximum individual path cost, under the...
SourceID	hal crossref elsevier
SourceType	Open Access Repository Enrichment Source Index Database Publisher
StartPage	74
SubjectTerms	Computer Science Fully polynomial-time approximation algorithms Multi-channel wireless networks Vertex- and channel-disjoint paths
Title	On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
URI	https://dx.doi.org/10.1016/j.tcs.2017.07.027 https://inria.hal.science/hal-01618077
Volume	695
WOSCitedRecordID	wos000412260800006&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1879-2294 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0000576 issn: 0304-3975 databaseCode: AIEXJ dateStart: 19950109 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLZKxwM8DBggNi6yEE9UmRInqePHCjZ1ULqhFSjiwXISR-lU0qlNq_0QfjDHtzblMo0HpMqqXDtKfT6fc2wfnw-hV1FA8jAR0iu6cehFUgqYUtL3aBh3GfWZDDQ34OcBHQ6T8ZidtVo_3F2Y1ZRWVXJ1xS7_q6ihDoStrs7-g7jXD4UK-A5ChxLEDuWNBH-qdi2W09qrZ1MJlqhWuVPLzgx0w3d76VKT3847H2fnKup8oWkiNFWADi_01GXgSqrwdcWoApqwMrHii6YnO2rcgMwsNUTH2tPfd6PL5XxmbaSOJTDKbjBZQ_OrbflFTsqlaO5FgH1TxzPdzQaZteYNHRaqgxdmyFEOpdGxCYVexHAbOyXcZXFDjRriHmeQyR9Vvdl1uDisM5V1PaA6B6vJM7CdVrvfO-dnb4_54GT4fvvXRixivzeAshRTT1MI-JSuYE29Q2jMkjba6Z0cjd9tLHxMzRm4_XPutFzHDf7yPn_zd26VbudeezKj-2jXLkFwz0DnAWrJag_dc_Qe2Gr7PXT3wzql7-Ih-nZa4W1cYYUr3MQV1rjCgCu8wRWeVHgLV9jhCjtcPUKfjo9Gb_qeZebwsjAMai-naZZl4P-EhAohg25RpOD7FyxKpC9oHKWpLxOW5TlJo5T4koapSKkfF6IQBDzux6hdzSr5BGGwD0kuCiZDkkVEUJbH4IQXsGqBlUtEk33ku_HjmU1br15_yl184gWHIedqyLkPH0L30et1l0uTs-W6xpETCreTxDiTHIB2XbeXIMD141WSdoAQV3UbAB3cpNFTdGczlZ6hdj1fyufodraqJ4v5Cwu9n6GFrk8
linkProvider	Elsevier
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=On+fault-tolerant+path+optimization+under+QoS+constraint+in+multi-channel+wireless+networks&rft.jtitle=Theoretical+computer+science&rft.au=Zhang%2C+Shurong&rft.au=Chen%2C+Lin&rft.au=Yang%2C+Weihua&rft.date=2017-09-26&rft.pub=Elsevier&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=695&rft.spage=74&rft.epage=82&rft_id=info:doi/10.1016%2Fj.tcs.2017.07.027&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-01618077v1
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon