{"id":"https://openalex.org/W4401508752","doi":"https://doi.org/10.1109/infocom52122.2024.10621256","title":"Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks","display_name":"Efficient Algorithm for Region-Disjoint Survivable Routing in Backbone Networks","publication_year":2024,"publication_date":"2024-05-20","ids":{"openalex":"https://openalex.org/W4401508752","doi":"https://doi.org/10.1109/infocom52122.2024.10621256"},"language":"en","primary_location":{"id":"doi:10.1109/infocom52122.2024.10621256","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom52122.2024.10621256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2024 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://real.mtak.hu/206341/1/Resilient_routing_INFOCOM_2024___Date_Line_Algorithm.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029594729","display_name":"Erika R. B\u00e9rczi\u2010Kov\u00e1cs","orcid":"https://orcid.org/0000-0003-2259-0868"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"Erika B\u00e9rczi-Kov\u00e1cs","raw_affiliation_strings":["ELTE Eötvös Loránd University,Department of Operations Research,Budapest,Hungary"],"affiliations":[{"raw_affiliation_string":"ELTE Eötvös Loránd University,Department of Operations Research,Budapest,Hungary","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068749505","display_name":"P\u00e9ter Gyimesi","orcid":"https://orcid.org/0000-0001-8504-9038"},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"P\u00e9ter Gyimesi","raw_affiliation_strings":["ELTE Eötvös Loránd University,Department of Operations Research,Budapest,Hungary"],"affiliations":[{"raw_affiliation_string":"ELTE Eötvös Loránd University,Department of Operations Research,Budapest,Hungary","institution_ids":["https://openalex.org/I106118109"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019599591","display_name":"Bal\u00e1zs Vass","orcid":"https://orcid.org/0000-0002-8589-7165"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Bal\u00e1zs Vass","raw_affiliation_strings":["Budapest University of Technology and Economics (BME) and ELKHBME Information Systems Research Group,Faculty of Electrical Engineering and Informatics (VIK),Department of Telecommunication and Media Informatics"],"affiliations":[{"raw_affiliation_string":"Budapest University of Technology and Economics (BME) and ELKHBME Information Systems Research Group,Faculty of Electrical Engineering and Informatics (VIK),Department of Telecommunication and Media Informatics","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062012037","display_name":"J\u00e1nos Tapolcai","orcid":"https://orcid.org/0000-0002-3512-9504"},"institutions":[{"id":"https://openalex.org/I29770179","display_name":"Budapest University of Technology and Economics","ror":"https://ror.org/02w42ss30","country_code":"HU","type":"education","lineage":["https://openalex.org/I29770179"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"J\u00e1nos Tapolcai","raw_affiliation_strings":["Budapest University of Technology and Economics (BME) and ELKHBME Information Systems Research Group,Faculty of Electrical Engineering and Informatics (VIK),Department of Telecommunication and Media Informatics"],"affiliations":[{"raw_affiliation_string":"Budapest University of Technology and Economics (BME) and ELKHBME Information Systems Research Group,Faculty of Electrical Engineering and Informatics (VIK),Department of Telecommunication and Media Informatics","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029594729"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":null,"apc_paid":null,"fwci":0.6209,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67837559,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"951","last_page":"960"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":1.0,"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":1.0,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9997000098228455,"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/computer-science","display_name":"Computer science","score":0.6910742521286011},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.683593213558197},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6112394332885742},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4959739148616791},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.45413264632225037},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.44313228130340576},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.42143532633781433},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.4174911081790924},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37141644954681396},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2392420470714569},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10533708333969116},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08176958560943604}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6910742521286011},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.683593213558197},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6112394332885742},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4959739148616791},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.45413264632225037},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.44313228130340576},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.42143532633781433},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.4174911081790924},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37141644954681396},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2392420470714569},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10533708333969116},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08176958560943604}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infocom52122.2024.10621256","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom52122.2024.10621256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2024 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"},{"id":"pmh:oai:real.mtak.hu:206341","is_oa":true,"landing_page_url":null,"pdf_url":"https://real.mtak.hu/206341/1/Resilient_routing_INFOCOM_2024___Date_Line_Algorithm.pdf","source":{"id":"https://openalex.org/S4306400081","display_name":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210140733","host_organization_name":"Library and Information Centre of the Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I4210140733"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"}],"best_oa_location":{"id":"pmh:oai:real.mtak.hu:206341","is_oa":true,"landing_page_url":null,"pdf_url":"https://real.mtak.hu/206341/1/Resilient_routing_INFOCOM_2024___Date_Line_Algorithm.pdf","source":{"id":"https://openalex.org/S4306400081","display_name":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210140733","host_organization_name":"Library and Information Centre of the Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I4210140733"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.41999998688697815}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334111","display_name":"Innovation Fund","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4401508752.pdf","grobid_xml":"https://content.openalex.org/works/W4401508752.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W1208784108","https://openalex.org/W1504111224","https://openalex.org/W1523318401","https://openalex.org/W1581410803","https://openalex.org/W1968540934","https://openalex.org/W1969357318","https://openalex.org/W1976411719","https://openalex.org/W1983684136","https://openalex.org/W1988160302","https://openalex.org/W2010333661","https://openalex.org/W2018538731","https://openalex.org/W2031946689","https://openalex.org/W2036142165","https://openalex.org/W2047848125","https://openalex.org/W2060031268","https://openalex.org/W2070253598","https://openalex.org/W2072919599","https://openalex.org/W2076306446","https://openalex.org/W2077296087","https://openalex.org/W2089079148","https://openalex.org/W2096701045","https://openalex.org/W2128097223","https://openalex.org/W2133768407","https://openalex.org/W2153730762","https://openalex.org/W2175373329","https://openalex.org/W2227557434","https://openalex.org/W2613070411","https://openalex.org/W2761156947","https://openalex.org/W2884082410","https://openalex.org/W3004952268","https://openalex.org/W3049006048","https://openalex.org/W3111732903","https://openalex.org/W3119886002","https://openalex.org/W4283217141","https://openalex.org/W4313227229","https://openalex.org/W4378697526","https://openalex.org/W6634679531","https://openalex.org/W6657508081","https://openalex.org/W6664171264","https://openalex.org/W6777699610"],"related_works":["https://openalex.org/W2075067217","https://openalex.org/W2149224531","https://openalex.org/W4254709952","https://openalex.org/W2026034687","https://openalex.org/W1687060458","https://openalex.org/W4247716783","https://openalex.org/W2160885658","https://openalex.org/W2098791961","https://openalex.org/W2144164383","https://openalex.org/W2103006090"],"abstract_inverted_index":{"Survivable":[0],"routing":[1],"is":[2,184],"crucial":[3],"in":[4,78,159],"backbone":[5],"networks":[6],"to":[7,21,31,97,185],"ensure":[8],"connectivity,":[9],"even":[10],"during":[11],"failures.":[12],"At":[13],"network":[14,18],"design,":[15],"groups":[16,28],"of":[17,44,51,71,112,178,190],"elements":[19],"prone":[20],"potential":[22],"failure":[23],"events":[24],"are":[25,29,41,93],"identified.":[26],"These":[27],"referred":[30],"as":[32],"Shared":[33],"Risk":[34],"Link":[35],"Groups":[36],"(SRLGs),":[37],"and":[38,100,121],"if":[39],"they":[40],"a":[42,48,63,68,79,105,172],"set":[43],"links":[45],"intersected":[46],"by":[47],"connected":[49],"region":[50],"the":[52,83,109,142,145,148,156,167,179,182,187],"plane,":[53],"we":[54],"call":[55],"them":[56],"regional-SRLGs.":[57],"A":[58],"recent":[59],"study":[60],"has":[61],"presented":[62],"polynomial-time":[64],"algorithm":[65],"for":[66,90,134,171],"finding":[67,132],"maximum":[69,110,188],"number":[70,111,189],"regional-SRLG-disjoint":[72,114,191],"paths":[73,84,115],"between":[74],"two":[75],"given":[76],"nodes":[77],"planar":[80],"topology,":[81],"with":[82,136],"being":[85],"nodedisjoint.":[86],"However,":[87],"existing":[88],"algorithms":[89],"this":[91],"problem":[92,157],"not":[94],"practical":[95],"due":[96],"their":[98],"runtime":[99,151],"implementation":[101],"complexities.This":[102],"paper":[103],"investigates":[104],"more":[106,173],"general":[107,174],"model,":[108],"non-crossing,":[113],"problem.":[116],"It":[117],"introduces":[118],"an":[119,127],"efficient":[120],"easily":[122],"implementable":[123],"algorithmic":[124],"framework,":[125],"leveraging":[126],"arbitrarily":[128],"chosen":[129],"shortest":[130],"path":[131],"subroutine":[133,143],"graphs":[135],"possibly":[137],"negative":[138],"weights.":[139],"Depending":[140],"on":[141],"chosen,":[144],"framework":[146,165],"improves":[147],"previous":[149],"worst-case":[150],"complexity,":[152],"or":[153],"can":[154],"solve":[155],"w.h.p.":[158],"near-linear":[160],"expected":[161],"time.":[162],"The":[163],"proposed":[164],"enables":[166],"first":[168],"additive":[169],"approximation":[170],"${\\mathcal{N}}{\\mathcal{P}}$":[175],"-hard":[176],"version":[177],"problem,":[180],"where":[181],"objective":[183],"find":[186],"paths.":[192],"We":[193],"validate":[194],"our":[195],"findings":[196],"through":[197],"extensive":[198],"simulations.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}