{"id":"https://openalex.org/W2130056190","doi":"https://doi.org/10.1109/tr.2010.2103592","title":"Addressing the Most Reliable Edge-Disjoint Paths With a Delay Constraint","display_name":"Addressing the Most Reliable Edge-Disjoint Paths With a Delay Constraint","publication_year":2011,"publication_date":"2011-01-10","ids":{"openalex":"https://openalex.org/W2130056190","doi":"https://doi.org/10.1109/tr.2010.2103592","mag":"2130056190"},"language":"en","primary_location":{"id":"doi:10.1109/tr.2010.2103592","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tr.2010.2103592","pdf_url":null,"source":{"id":"https://openalex.org/S87725633","display_name":"IEEE Transactions on Reliability","issn_l":"0018-9529","issn":["0018-9529","1558-1721"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Reliability","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012806888","display_name":"Ruen Chze Loh","orcid":null},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ruen Chze Loh","raw_affiliation_strings":["Department of Computing, Curtin University of Technology, Perth, WA, Australia","Dept. of Comput., Curtin Univ. of Technol., Perth, WA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, Curtin University of Technology, Perth, WA, Australia","institution_ids":["https://openalex.org/I205640436"]},{"raw_affiliation_string":"Dept. of Comput., Curtin Univ. of Technol., Perth, WA, Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035058895","display_name":"Sieteng Soh","orcid":"https://orcid.org/0000-0001-8974-3158"},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Sieteng Soh","raw_affiliation_strings":["Department of Computing, Curtin University of Technology, Perth, WA, Australia","Dept. of Comput., Curtin Univ. of Technol., Perth, WA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, Curtin University of Technology, Perth, WA, Australia","institution_ids":["https://openalex.org/I205640436"]},{"raw_affiliation_string":"Dept. of Comput., Curtin Univ. of Technol., Perth, WA, Australia","institution_ids":["https://openalex.org/I205640436"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034107686","display_name":"Mihai Lazarescu","orcid":"https://orcid.org/0000-0002-4394-4293"},"institutions":[{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Mihai Lazarescu","raw_affiliation_strings":["Department of Computing, Curtin University of Technology, Perth, WA, Australia","Dept. of Comput., Curtin Univ. of Technol., Perth, WA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, Curtin University of Technology, Perth, WA, Australia","institution_ids":["https://openalex.org/I205640436"]},{"raw_affiliation_string":"Dept. of Comput., Curtin Univ. of Technol., Perth, WA, Australia","institution_ids":["https://openalex.org/I205640436"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I205640436"],"apc_list":null,"apc_paid":null,"fwci":0.2703,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.64220775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"60","issue":"1","first_page":"88","last_page":"93"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.6702186465263367},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5706367492675781},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5689730048179626},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5649230480194092},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.512519121170044},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4989895820617676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49639660120010376},{"id":"https://openalex.org/keywords/reliability-theory","display_name":"Reliability theory","score":0.4642670154571533},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4606786370277405},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4537811279296875},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4371260106563568},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4041801393032074},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33822399377822876},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14617231488227844},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09989163279533386},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09946790337562561},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07930803298950195}],"concepts":[{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.6702186465263367},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5706367492675781},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5689730048179626},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5649230480194092},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.512519121170044},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4989895820617676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49639660120010376},{"id":"https://openalex.org/C201729545","wikidata":"https://www.wikidata.org/wiki/Q2193887","display_name":"Reliability theory","level":3,"score":0.4642670154571533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4606786370277405},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4537811279296875},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4371260106563568},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4041801393032074},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33822399377822876},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14617231488227844},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09989163279533386},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09946790337562561},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07930803298950195},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C163164238","wikidata":"https://www.wikidata.org/wiki/Q2737027","display_name":"Failure rate","level":2,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tr.2010.2103592","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tr.2010.2103592","pdf_url":null,"source":{"id":"https://openalex.org/S87725633","display_name":"IEEE Transactions on Reliability","issn_l":"0018-9529","issn":["0018-9529","1558-1721"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Reliability","raw_type":"journal-article"},{"id":"pmh:oai:espace.curtin.edu.au:20.500.11937/49558","is_oa":false,"landing_page_url":"http://hdl.handle.net/20.500.11937/49558","pdf_url":null,"source":{"id":"https://openalex.org/S4306401790","display_name":"eSpace (Curtin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205640436","host_organization_name":"Curtin University","host_organization_lineage":["https://openalex.org/I205640436"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1494160116","https://openalex.org/W1981429531","https://openalex.org/W1988144156","https://openalex.org/W1998944191","https://openalex.org/W2034269606","https://openalex.org/W2109277009","https://openalex.org/W2120889123","https://openalex.org/W2153926625","https://openalex.org/W2160658249","https://openalex.org/W2161591474","https://openalex.org/W6629466543"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W2138685729","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W2098284475","https://openalex.org/W26693340"],"abstract_inverted_index":{"Recently,":[0],"multipath":[1],"solutions":[2],"have":[3],"been":[4],"proposed":[5],"to":[6,13,27,136],"improve":[7],"the":[8,11,24,101,109,140],"quality-of-service":[9],"of":[10,104],"source":[12],"destination":[14],"(s,t)-path":[15],"in":[16,108],"communication":[17],"networks":[18,124],"(CNs).":[19],"This":[20,54],"paper":[21,61],"de":[22],"scribes":[23],"\u03bbDP/DR":[25],"problem":[26,55],"obtain":[28],"\u03bb":[29],"\u2265":[30,52,113],"1":[31],"edge-disjoint":[32],"(s,t)-paths":[33],"(\u03bbDP)":[34],"such":[35],"that":[36,126],"its":[37,43],"reliability":[38,77,103,134],"is":[39,56,100],"maximized":[40],"while":[41],"keeping":[42],"delay":[44,49,132],"no":[45],"longer":[46],"than":[47],"a":[48],"constraint":[50],"D":[51],"1.":[53,114],"NP-hard,":[57],"and":[58,76,111,121,133],"thus":[59],"this":[60],"proposes":[62],"an":[63],"approximate":[64],"solution":[65,128],"using":[66],"Lagrange-relaxation.":[67],"Our":[68,115],"algorithm":[69],"generates":[70],"\u03bbDP":[71,130],"with":[72,131],"\u03b4(\u03bbDP)":[73],"\u2264":[74,85,87],"D,":[75],"bounded":[78],"by":[79,139],"|log(R":[80],"<sub":[81,91,97],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[82,92,98],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">min</sub>":[83,93,99],")|":[84],"|log(\u03c1(\u03bbDP))|":[86],"(1":[88],"+":[89],"k)*|log(R":[90],")|,":[94],"where":[95],"R":[96],"minimum":[102],"any":[105],"(s,":[106],"t)-path":[107],"CN,":[110],"k":[112],"simulations":[116],"on":[117],"forty":[118],"random":[119],"CNs":[120],"large":[122],"grid":[123],"show":[125],"our":[127],"produces":[129],"comparable":[135],"those":[137],"obtained":[138],"optimal":[141],"but":[142],"exponential":[143],"time":[144],"algorithm.":[145]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}