{"id":"https://openalex.org/W2922953382","doi":"https://doi.org/10.1109/jsac.2019.2906742","title":"Scalable and Efficient Multipath Routing via Redundant Trees","display_name":"Scalable and Efficient Multipath Routing via Redundant Trees","publication_year":2019,"publication_date":"2019-03-21","ids":{"openalex":"https://openalex.org/W2922953382","doi":"https://doi.org/10.1109/jsac.2019.2906742","mag":"2922953382"},"language":"en","primary_location":{"id":"doi:10.1109/jsac.2019.2906742","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsac.2019.2906742","pdf_url":null,"source":{"id":"https://openalex.org/S90422530","display_name":"IEEE Journal on Selected Areas in Communications","issn_l":"0733-8716","issn":["0733-8716","1558-0008"],"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 Journal on Selected Areas in Communications","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/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":["MTA-BME Future Internet Research Group, MTA-BME Information Systems Research Group, Budapest University of Technology and Economics, Budapest, Hungary"],"raw_orcid":"https://orcid.org/0000-0002-3512-9504","affiliations":[{"raw_affiliation_string":"MTA-BME Future Internet Research Group, MTA-BME Information Systems Research Group, Budapest University of Technology and Economics, Budapest, Hungary","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":["MTA-BME Future Internet Research Group, MTA-BME Information Systems Research Group, Budapest University of Technology and Economics, Budapest, Hungary"],"raw_orcid":"https://orcid.org/0000-0002-5958-7817","affiliations":[{"raw_affiliation_string":"MTA-BME Future Internet Research Group, MTA-BME Information Systems Research Group, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"middle","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":["MTA-BME Future Internet Research Group, MTA-BME Information Systems Research Group, Budapest University of Technology and Economics, Budapest, Hungary"],"raw_orcid":"https://orcid.org/0000-0003-1644-2172","affiliations":[{"raw_affiliation_string":"MTA-BME Future Internet Research Group, MTA-BME Information Systems Research Group, Budapest University of Technology and Economics, Budapest, Hungary","institution_ids":["https://openalex.org/I29770179"]}]},{"author_position":"last","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/I4210132479","display_name":"Calvary Hospital","ror":"https://ror.org/041c7s516","country_code":"AU","type":"healthcare","lineage":["https://openalex.org/I4210132479"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Erika R. Berczi-Kovacs","raw_affiliation_strings":["MTA-ELTE Egerv\u00e1ry Research Group on Combinatorial Optimization"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MTA-ELTE Egerv\u00e1ry Research Group on Combinatorial Optimization","institution_ids":["https://openalex.org/I4210132479"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0455,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.8779098,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"37","issue":"5","first_page":"982","last_page":"996"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":1.0,"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":1.0,"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.9990000128746033,"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.9955999851226807,"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.8622325658798218},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6034999489784241},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5793237090110779},{"id":"https://openalex.org/keywords/software-defined-networking","display_name":"Software-defined networking","score":0.5786316394805908},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.5740254521369934},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5667190551757812},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5348917841911316},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5342736840248108},{"id":"https://openalex.org/keywords/forwarding-plane","display_name":"Forwarding plane","score":0.502952516078949},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4901624619960785},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.48182907700538635},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47203174233436584},{"id":"https://openalex.org/keywords/multipath-propagation","display_name":"Multipath propagation","score":0.4572477340698242},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4546227753162384},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.44427868723869324},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.44045281410217285},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.41802069544792175},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.3807353377342224},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.28286486864089966},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2801874577999115},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.09745290875434875},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08489382266998291}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8622325658798218},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6034999489784241},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5793237090110779},{"id":"https://openalex.org/C77270119","wikidata":"https://www.wikidata.org/wiki/Q1655198","display_name":"Software-defined networking","level":2,"score":0.5786316394805908},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.5740254521369934},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5667190551757812},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5348917841911316},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5342736840248108},{"id":"https://openalex.org/C10597312","wikidata":"https://www.wikidata.org/wiki/Q5473302","display_name":"Forwarding plane","level":3,"score":0.502952516078949},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4901624619960785},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.48182907700538635},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47203174233436584},{"id":"https://openalex.org/C161218011","wikidata":"https://www.wikidata.org/wiki/Q11827794","display_name":"Multipath propagation","level":3,"score":0.4572477340698242},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4546227753162384},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.44427868723869324},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.44045281410217285},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.41802069544792175},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.3807353377342224},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.28286486864089966},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2801874577999115},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.09745290875434875},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08489382266998291},{"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jsac.2019.2906742","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsac.2019.2906742","pdf_url":null,"source":{"id":"https://openalex.org/S90422530","display_name":"IEEE Journal on Selected Areas in Communications","issn_l":"0733-8716","issn":["0733-8716","1558-0008"],"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 Journal on Selected Areas in Communications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W119645300","https://openalex.org/W1530120774","https://openalex.org/W1554012027","https://openalex.org/W1712623641","https://openalex.org/W1964393599","https://openalex.org/W1968454752","https://openalex.org/W1971529969","https://openalex.org/W1994926493","https://openalex.org/W2019522237","https://openalex.org/W2022175859","https://openalex.org/W2032850957","https://openalex.org/W2036538006","https://openalex.org/W2040053316","https://openalex.org/W2040678819","https://openalex.org/W2062032542","https://openalex.org/W2068384525","https://openalex.org/W2089641163","https://openalex.org/W2091748931","https://openalex.org/W2098862160","https://openalex.org/W2107276343","https://openalex.org/W2111987526","https://openalex.org/W2118404561","https://openalex.org/W2120545656","https://openalex.org/W2123790987","https://openalex.org/W2128678576","https://openalex.org/W2134519279","https://openalex.org/W2139998597","https://openalex.org/W2140518552","https://openalex.org/W2147118406","https://openalex.org/W2155061423","https://openalex.org/W2161090120","https://openalex.org/W2167499506","https://openalex.org/W2239950938","https://openalex.org/W2420522041","https://openalex.org/W2568193150","https://openalex.org/W2743987472","https://openalex.org/W2786499672","https://openalex.org/W2791458314","https://openalex.org/W2806041759","https://openalex.org/W2891681643","https://openalex.org/W2891925502","https://openalex.org/W2981546155","https://openalex.org/W3103142336","https://openalex.org/W4285719527","https://openalex.org/W6604788553","https://openalex.org/W6631761062","https://openalex.org/W6637565887","https://openalex.org/W6731565355","https://openalex.org/W6752219595"],"related_works":["https://openalex.org/W4214777079","https://openalex.org/W3122360749","https://openalex.org/W2547441564","https://openalex.org/W2137036704","https://openalex.org/W2051935741","https://openalex.org/W4377224402","https://openalex.org/W4211055425","https://openalex.org/W2292300552","https://openalex.org/W1984835167","https://openalex.org/W3195498289"],"abstract_inverted_index":{"Nowadays,":[0],"a":[1,24,29,78,93,182,193],"majority":[2],"of":[3,32,40,81,91,95,128],"the":[4,33,74,89,126,129,154,169],"Internet":[5],"service":[6],"providers":[7],"are":[8],"either":[9],"piloting":[10],"or":[11,98],"migrating":[12],"to":[13,150,191],"software-defined":[14],"networking":[15],"(SDN)":[16],"in":[17],"their":[18,41],"networks.":[19],"In":[20,84],"an":[21],"SDN":[22],"architecture":[23],"central":[25],"network":[26,34],"controller":[27],"has":[28],"top-down":[30],"view":[31],"and":[35,135],"can":[36,58,103],"directly":[37],"configure":[38],"each":[39,63],"physical":[42],"switches.":[43],"It":[44],"opens":[45],"up":[46],"several":[47],"fundamental":[48],"unsolved":[49],"challenges,":[50],"such":[51],"as":[52],"deploying":[53],"efficient":[54],"multipath":[55,173],"routing":[56,174],"that":[57,102,125,146,179],"provide":[59],"disjoint":[60,100],"end-to-end":[61],"paths,":[62],"one":[64],"satisfying":[65],"specific":[66],"operational":[67],"goals":[68],"(e.g.,":[69],"shortest":[70,96],"possible),":[71],"without":[72],"overwhelming":[73],"data":[75],"plane":[76],"with":[77,159],"prohibitive":[79],"amount":[80],"forwarding":[82,109],"state.":[83],"this":[85,199],"paper,":[86],"we":[87,123,136,144,177],"study":[88],"problem":[90,132],"finding":[92],"pair":[94],"(node-":[97],"edge-)":[99],"paths":[101],"be":[104],"represented":[105],"by":[106],"only":[107],"two":[108],"table":[110],"entries":[111],"per":[112],"destination.":[113],"Building":[114],"on":[115,118],"prior":[116],"work":[117],"minimum":[119,194],"length":[120,158,195],"redundant":[121],"trees,":[122],"show":[124,178],"complexity":[127],"underlying":[130],"mathematical":[131],"is":[133,148,164,185],"NP-complete":[134,190],"present":[137],"fast":[138],"heuristic":[139],"algorithms.":[140],"By":[141],"extensive":[142],"simulations,":[143],"find":[145,192],"it":[147,188],"possible":[149],"very":[151],"closely":[152],"attain":[153],"absolute":[155],"optimal":[156],"path":[157],"our":[160],"algorithms":[161],"(the":[162],"gap":[163],"just":[165],"1%-5%),":[166],"eventually":[167],"opening":[168],"door":[170],"for":[171],"wide-scale":[172],"deployments.":[175],"Finally,":[176],"even":[180],"if":[181],"primary":[183,200],"tree":[184,197],"already":[186],"given":[187],"remains":[189],"secondary":[196],"concerning":[198],"tree.":[201]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}