{"id":"https://openalex.org/W4415933928","doi":"https://doi.org/10.1109/nof66640.2025.11223326","title":"Using Path Identifiers for Efficient Loop-Free Routing in Computer Networks","display_name":"Using Path Identifiers for Efficient Loop-Free Routing in Computer Networks","publication_year":2025,"publication_date":"2025-09-30","ids":{"openalex":"https://openalex.org/W4415933928","doi":"https://doi.org/10.1109/nof66640.2025.11223326"},"language":null,"primary_location":{"id":"doi:10.1109/nof66640.2025.11223326","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nof66640.2025.11223326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 16th International Conference on Network of the Future (NoF)","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/A5065935907","display_name":"J.J. Garcia\u2010Luna\u2010Aceves","orcid":"https://orcid.org/0000-0001-9914-6031"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"J.J. Garcia-Luna-Aceves","raw_affiliation_strings":["University of Toronto,Electrical and Computer Engineering Department"],"affiliations":[{"raw_affiliation_string":"University of Toronto,Electrical and Computer Engineering Department","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091447229","display_name":"Morteza Moghaddassian","orcid":"https://orcid.org/0000-0002-6149-0774"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Morteza Moghaddassian","raw_affiliation_strings":["University of Toronto,Electrical and Computer Engineering Department"],"affiliations":[{"raw_affiliation_string":"University of Toronto,Electrical and Computer Engineering Department","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054009986","display_name":"Chia-Ming Hsieh","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Charles Hsieh","raw_affiliation_strings":["University of Toronto,Electrical and Computer Engineering Department"],"affiliations":[{"raw_affiliation_string":"University of Toronto,Electrical and Computer Engineering Department","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065935907"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.37777542,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.3206000030040741,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.3206000030040741,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.2851000130176544,"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.1518000066280365,"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/identifier","display_name":"Identifier","score":0.7828999757766724},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6987000107765198},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5508999824523926},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5146999955177307},{"id":"https://openalex.org/keywords/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.47279998660087585},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.46239998936653137},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45260000228881836},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4413999915122986},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4345000088214874}],"concepts":[{"id":"https://openalex.org/C154504017","wikidata":"https://www.wikidata.org/wiki/Q853614","display_name":"Identifier","level":2,"score":0.7828999757766724},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6987000107765198},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6682999730110168},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.644599974155426},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5508999824523926},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5146999955177307},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.47940000891685486},{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.47279998660087585},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.46239998936653137},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45260000228881836},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4413999915122986},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4345000088214874},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.42640000581741333},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4047999978065491},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.40220001339912415},{"id":"https://openalex.org/C44010500","wikidata":"https://www.wikidata.org/wiki/Q1422567","display_name":"Source routing","level":5,"score":0.3937000036239624},{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.3921000063419342},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.35440000891685486},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.3522999882698059},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.33649998903274536},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.328900009393692},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3149999976158142},{"id":"https://openalex.org/C7573999","wikidata":"https://www.wikidata.org/wiki/Q207580","display_name":"Routing Information Protocol","level":5,"score":0.29679998755455017},{"id":"https://openalex.org/C177818476","wikidata":"https://www.wikidata.org/wiki/Q12878103","display_name":"Hierarchical routing","level":5,"score":0.29679998755455017},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.2865000069141388},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.28619998693466187},{"id":"https://openalex.org/C94600068","wikidata":"https://www.wikidata.org/wiki/Q7371621","display_name":"Routing domain","level":5,"score":0.2770000100135803},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.2662000060081482},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.26179999113082886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2508000135421753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/nof66640.2025.11223326","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nof66640.2025.11223326","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 16th International Conference on Network of the Future (NoF)","raw_type":"proceedings-article"}],"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/W1914254714","https://openalex.org/W1982349759","https://openalex.org/W2010053579","https://openalex.org/W2055654205","https://openalex.org/W2061349678","https://openalex.org/W2062728787","https://openalex.org/W2084646168","https://openalex.org/W2095738494","https://openalex.org/W2099574482","https://openalex.org/W2120450054","https://openalex.org/W2133723319","https://openalex.org/W2138760535","https://openalex.org/W2148769607","https://openalex.org/W2151085851","https://openalex.org/W2249711818","https://openalex.org/W2296143987","https://openalex.org/W2298498790","https://openalex.org/W2403202602","https://openalex.org/W2944068553","https://openalex.org/W3012493060","https://openalex.org/W3109456450","https://openalex.org/W4235154472","https://openalex.org/W4243218172","https://openalex.org/W4247255165","https://openalex.org/W4283210985","https://openalex.org/W4293902548","https://openalex.org/W4302094287","https://openalex.org/W4320031084"],"related_works":[],"abstract_inverted_index":{"A":[0,41],"new":[1],"family":[2],"of":[3,23,54,88,91,96,137],"algorithms":[4],"for":[5,65],"loop-free":[6,31,104],"routing":[7,32,129],"over":[8],"multiple":[9],"paths":[10,116],"based":[11],"on":[12,134],"path":[13,24,42,48,85,105],"identifiers":[14,25],"is":[15,18,36,67,110],"introduced.":[16],"It":[17],"shown":[19,111],"that":[20,56,107],"different":[21],"types":[22],"can":[26,44],"be":[27,59,123],"used":[28],"to":[29,50,80,106,112,114,122,125],"attain":[30],"if":[33],"total":[34],"ordering":[35],"established":[37],"among":[38],"such":[39],"identifiers.":[40],"identifier":[43,86,95],"range":[45],"from":[46],"the":[47,89,94,97,135],"itself":[49],"a":[51,84,143],"succinct":[52],"representation":[53],"it":[55],"need":[57],"not":[58],"unique.":[60],"POLAR":[61,109],"(Path-Ordered":[62],"Loop-free":[63],"Algorithm":[64],"Routing)":[66],"presented":[68],"as":[69],"an":[70],"example":[71],"in":[72,142],"which":[73],"each":[74,81],"router":[75],"labels":[76],"its":[77,101],"shortest":[78,115],"distance":[79],"destination":[82],"with":[83],"consisting":[87],"number":[90],"hops":[92],"and":[93,121],"second-to-last":[98],"hop":[99],"along":[100],"least":[102],"preferred":[103],"destination.":[108],"converge":[113,126],"without":[117],"ever":[118],"creating":[119],"loops,":[120],"able":[124],"faster":[127],"than":[128],"protocols":[130],"like":[131],"OSPF":[132],"depending":[133],"type":[136],"topology":[138],"changes":[139],"taking":[140],"place":[141],"network.":[144]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-11-05T00:00:00"}