{"id":"https://openalex.org/W4286571629","doi":"https://doi.org/10.23919/ifipnetworking55013.2022.9829760","title":"Routing on the Shortest Pairs of Disjoint Paths","display_name":"Routing on the Shortest Pairs of Disjoint Paths","publication_year":2022,"publication_date":"2022-06-13","ids":{"openalex":"https://openalex.org/W4286571629","doi":"https://doi.org/10.23919/ifipnetworking55013.2022.9829760"},"language":"en","primary_location":{"id":"doi:10.23919/ifipnetworking55013.2022.9829760","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ifipnetworking55013.2022.9829760","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IFIP Networking Conference (IFIP Networking)","raw_type":"proceedings-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/A5081451152","display_name":"P\u00e9ter Babarczi","orcid":"https://orcid.org/0000-0003-1644-2172"},"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":"Peter Babarczi","raw_affiliation_strings":["Budapest University of Technology and Economics,Faculty of Electrical Engineering and Informatics,Department of Telecommunications and Media Informatics,Budapest,Hungary,H-1111"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Budapest University of Technology and Economics,Faculty of Electrical Engineering and Informatics,Department of Telecommunications and Media Informatics,Budapest,Hungary,H-1111","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014559047","display_name":"G\u00e1bor R\u00e9tv\u00e1ri","orcid":"https://orcid.org/0000-0002-5958-7817"},"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":"Gabor Retvari","raw_affiliation_strings":["Budapest University of Technology and Economics,Faculty of Electrical Engineering and Informatics,Department of Telecommunications and Media Informatics,Budapest,Hungary,H-1111"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Budapest University of Technology and Economics,Faculty of Electrical Engineering and Informatics,Department of Telecommunications and Media Informatics,Budapest,Hungary,H-1111","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034769205","display_name":"Lajos R\u00f3nyai","orcid":"https://orcid.org/0000-0002-8364-9627"},"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"]},{"id":"https://openalex.org/I4210117195","display_name":"HUN-REN Institute for Computer Science and Control","ror":"https://ror.org/0249v7n71","country_code":"HU","type":"facility","lineage":["https://openalex.org/I4210117195","https://openalex.org/I4387152226"]}],"countries":["HU"],"is_corresponding":false,"raw_author_name":"Lajos Ronyai","raw_affiliation_strings":["Institute for Computer Science and Control, Institute of Mathematics, Budapest University of Technology and Economics, Eötvös Lorand Research Network,Department of Algebra,Budapest,Hungary,H-1111"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Science and Control, Institute of Mathematics, Budapest University of Technology and Economics, Eötvös Lorand Research Network,Department of Algebra,Budapest,Hungary,H-1111","institution_ids":["https://openalex.org/I4210117195","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":"Janos Tapolcai","raw_affiliation_strings":["Budapest University of Technology and Economics,Faculty of Electrical Engineering and Informatics,Department of Telecommunications and Media Informatics,Budapest,Hungary,H-1111"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Budapest University of Technology and Economics,Faculty of Electrical Engineering and Informatics,Department of Telecommunications and Media Informatics,Budapest,Hungary,H-1111","institution_ids":["https://openalex.org/I29770179"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5704,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67944811,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","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"}},"topics":[{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"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.9993000030517578,"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.779079020023346},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6727897524833679},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6496917009353638},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6213405728340149},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.5836270451545715},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5687779188156128},{"id":"https://openalex.org/keywords/ip-forwarding","display_name":"IP forwarding","score":0.5130018591880798},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5044955015182495},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5013017654418945},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47456982731819153},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.4716329276561737},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.4703940153121948},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.46825820207595825},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.44307345151901245},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.421644389629364},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2785608768463135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13321498036384583},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11609646677970886},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.08942916989326477}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.779079020023346},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6727897524833679},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6496917009353638},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6213405728340149},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.5836270451545715},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5687779188156128},{"id":"https://openalex.org/C174809319","wikidata":"https://www.wikidata.org/wiki/Q5973191","display_name":"IP forwarding","level":5,"score":0.5130018591880798},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5044955015182495},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5013017654418945},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47456982731819153},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.4716329276561737},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.4703940153121948},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.46825820207595825},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.44307345151901245},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.421644389629364},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2785608768463135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13321498036384583},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11609646677970886},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.08942916989326477}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23919/ifipnetworking55013.2022.9829760","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ifipnetworking55013.2022.9829760","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IFIP Networking Conference (IFIP Networking)","raw_type":"proceedings-article"},{"id":"pmh:oai:real.mtak.hu:151827","is_oa":false,"landing_page_url":null,"pdf_url":null,"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":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item"},{"id":"pmh:oai:eprints.sztaki.hu:10383","is_oa":false,"landing_page_url":"https://eprints.sztaki.hu/10383/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Section"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1530120774","https://openalex.org/W1999465177","https://openalex.org/W2011282943","https://openalex.org/W2019637647","https://openalex.org/W2032950184","https://openalex.org/W2073944747","https://openalex.org/W2098862160","https://openalex.org/W2102722785","https://openalex.org/W2103615771","https://openalex.org/W2111944885","https://openalex.org/W2118404561","https://openalex.org/W2136377206","https://openalex.org/W2155061423","https://openalex.org/W2161090120","https://openalex.org/W2167499506","https://openalex.org/W2169528473","https://openalex.org/W2293710962","https://openalex.org/W2493944851","https://openalex.org/W2613070411","https://openalex.org/W2744868672","https://openalex.org/W2903003182","https://openalex.org/W2922953382","https://openalex.org/W3137671267","https://openalex.org/W4206060609","https://openalex.org/W4237496336","https://openalex.org/W6631761062","https://openalex.org/W6737231788","https://openalex.org/W6757290574"],"related_works":["https://openalex.org/W2162675074","https://openalex.org/W3163135404","https://openalex.org/W4299830794","https://openalex.org/W2952913234","https://openalex.org/W189149726","https://openalex.org/W2126587030","https://openalex.org/W2134468116","https://openalex.org/W2139033145","https://openalex.org/W4313562922","https://openalex.org/W4286571629"],"abstract_inverted_index":{"Recent":[0],"trends":[1],"point":[2],"towards":[3,88],"communication":[4],"networks":[5],"will":[6],"be":[7,35],"multi-path":[8,32],"in":[9,40,51,121,131],"nature":[10],"to":[11,31,42,135],"increase":[12],"failure":[13],"resilience,":[14],"support":[15],"load-balancing":[16],"and":[17,96],"provide":[18],"alternate":[19],"paths":[20,68,150,161],"for":[21,47],"congestion":[22],"avoidance.":[23],"We":[24,80],"argue":[25],"that":[26,82,120,144],"the":[27,44,58,63,74,83,132,138,152,159,168],"transition":[28],"from":[29],"single-path":[30],"routing":[33,61,78],"should":[34],"as":[36,38],"seamless":[37],"possible":[39],"order":[41],"lower":[43],"deployability":[45],"barrier":[46],"network":[48],"operators.":[49],"Therefore,":[50],"this":[52],"paper":[53],"we":[54,97,142],"are":[55,129],"focusing":[56],"on":[57,137],"problem":[59],"of":[60,66,85,155,167],"along":[62],"shortest":[64,153,160],"pairs":[65],"disjoint":[67,86,139,156],"between":[69],"each":[70],"source-destination":[71],"pair":[72,154],"over":[73],"currently":[75],"deployed":[76],"link-state":[77],"architecture.":[79],"show":[81,143],"union":[84],"path-pairs":[87],"a":[89,93],"given":[90],"destination":[91],"has":[92],"special":[94],"structure,":[95],"propose":[98],"an":[99],"efficient":[100],"tag":[101],"encoding":[102],"scheme":[103],"which":[104,163],"requires":[105],"only":[106,125],"one":[107],"extra":[108],"forwarding":[109],"table":[110],"entry":[111],"per":[112,114],"router":[113],"destination.":[115],"Our":[116],"numerical":[117],"evaluations":[118],"demonstrate":[119],"real-world":[122],"topologies":[123],"usually":[124],"4":[126],"bit":[127],"tags":[128,146],"sufficient":[130],"packet":[133],"headers":[134],"route":[136],"path-pairs.":[140],"Finally,":[141],"our":[145],"automatically":[147],"encode":[148],"additional":[149],"beyond":[151],"paths,":[157],"including":[158],"themselves,":[162],"enables":[164],"incremental":[165],"deployment":[166],"proposed":[169],"method.":[170]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}