{"id":"https://openalex.org/W4293902548","doi":"https://doi.org/10.1109/lcn53696.2022.9843624","title":"Safe, Fast, and Cycle-Free Multi-Path Routing Using Vouchers","display_name":"Safe, Fast, and Cycle-Free Multi-Path Routing Using Vouchers","publication_year":2022,"publication_date":"2022-08-26","ids":{"openalex":"https://openalex.org/W4293902548","doi":"https://doi.org/10.1109/lcn53696.2022.9843624"},"language":"en","primary_location":{"id":"doi:10.1109/lcn53696.2022.9843624","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn53696.2022.9843624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","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/A5108379099","display_name":"J. J. Garcia\u2010Luna\u2010Aceves","orcid":null},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. J. Garcia-Luna-Aceves","raw_affiliation_strings":["University of California,Computer Science and Engineering Department,Santa Cruz Santa Cruz,CA,USA","Computer Science and Engineering Department, University of California, Santa Cruz Santa Cruz, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California,Computer Science and Engineering Department,Santa Cruz Santa Cruz,CA,USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"Computer Science and Engineering Department, University of California, Santa Cruz Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5108379099"],"corresponding_institution_ids":["https://openalex.org/I185103710"],"apc_list":null,"apc_paid":null,"fwci":0.2761,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.56189064,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"367","last_page":"370"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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/T10246","display_name":"Mobile Ad Hoc Networks","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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9988999962806702,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.996999979019165,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6769464015960693},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.659914493560791},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6581010818481445},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6539537310600281},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5738281011581421},{"id":"https://openalex.org/keywords/voucher","display_name":"Voucher","score":0.563645601272583},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5370084047317505},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.48301467299461365},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46986350417137146},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4252157211303711},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40401825308799744},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.39711618423461914},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1626051664352417},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.13513058423995972},{"id":"https://openalex.org/keywords/world-wide-web","display_name":"World Wide Web","score":0.06802961230278015}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6769464015960693},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.659914493560791},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6581010818481445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6539537310600281},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5738281011581421},{"id":"https://openalex.org/C105458232","wikidata":"https://www.wikidata.org/wiki/Q689044","display_name":"Voucher","level":2,"score":0.563645601272583},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5370084047317505},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.48301467299461365},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46986350417137146},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4252157211303711},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40401825308799744},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.39711618423461914},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1626051664352417},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13513058423995972},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.06802961230278015},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcn53696.2022.9843624","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcn53696.2022.9843624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2120450054","https://openalex.org/W2138760535","https://openalex.org/W2157457404","https://openalex.org/W2249711818","https://openalex.org/W6691700171"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W2064711473","https://openalex.org/W1972487624","https://openalex.org/W1515277195","https://openalex.org/W2186932829","https://openalex.org/W2121598558","https://openalex.org/W2237860883","https://openalex.org/W1698965822","https://openalex.org/W1971025399","https://openalex.org/W1579931977"],"abstract_inverted_index":{"A":[0],"new":[1,25,48],"approach":[2,49],"to":[3,15,28,45,52],"loop-free":[4,57],"shortest-path":[5,58],"routing":[6,33,59],"is":[7,50],"introduced":[8],"that":[9,13,41],"uses":[10],"distance":[11],"vouchers":[12],"attest":[14],"the":[16],"acyclic":[17],"nature":[18],"of":[19],"paths.":[20],"Routers":[21],"search":[22],"and":[23],"find":[24],"shortest":[26],"paths":[27],"destinations":[29],"without":[30],"ever":[31],"creating":[32],"loops":[34],"by":[35,39],"trusting":[36],"updates":[37],"originated":[38],"routers":[40],"vouch":[42],"being":[43],"closer":[44],"destinations.":[46],"The":[47],"shown":[51],"converge":[53],"faster":[54],"than":[55],"prior":[56],"methods.":[60]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}