{"id":"https://openalex.org/W4400689446","doi":"https://doi.org/10.1145/3673422.3674891","title":"DARE: Making Diffusing Computations More Efficient for Loop-Free Shortest-Path Routing","display_name":"DARE: Making Diffusing Computations More Efficient for Loop-Free Shortest-Path Routing","publication_year":2024,"publication_date":"2024-07-16","ids":{"openalex":"https://openalex.org/W4400689446","doi":"https://doi.org/10.1145/3673422.3674891"},"language":"en","primary_location":{"id":"doi:10.1145/3673422.3674891","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3673422.3674891","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Applied Networking Research Workshop on zzz","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3673422.3674891","any_repository_has_fulltext":null},"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":["Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","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":["Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065935907"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":0.3663,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.58942225,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"31","last_page":"37"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991999864578247,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991999864578247,"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.7039697766304016},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.61289381980896},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5492543578147888},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.5485707521438599},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.539654016494751},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4865242838859558},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.46956491470336914},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.43752002716064453},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3246503472328186},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.24685925245285034},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.22305545210838318},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.22202089428901672},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21963679790496826},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1709185540676117},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.1549982726573944},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11362507939338684},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.05142742395401001}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7039697766304016},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.61289381980896},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5492543578147888},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.5485707521438599},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.539654016494751},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4865242838859558},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.46956491470336914},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.43752002716064453},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3246503472328186},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24685925245285034},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.22305545210838318},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.22202089428901672},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21963679790496826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1709185540676117},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.1549982726573944},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11362507939338684},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.05142742395401001}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3673422.3674891","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3673422.3674891","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Applied Networking Research Workshop on zzz","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3673422.3674891","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3673422.3674891","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Applied Networking Research Workshop on zzz","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1164107441","https://openalex.org/W1564531230","https://openalex.org/W1620856823","https://openalex.org/W1914254714","https://openalex.org/W1969057198","https://openalex.org/W1971663816","https://openalex.org/W2004032063","https://openalex.org/W2033347526","https://openalex.org/W2033871392","https://openalex.org/W2056339657","https://openalex.org/W2120450054","https://openalex.org/W2133723319","https://openalex.org/W2135035173","https://openalex.org/W2157457404","https://openalex.org/W2249711818","https://openalex.org/W2303186826","https://openalex.org/W2506906025","https://openalex.org/W2727284572","https://openalex.org/W3148033683","https://openalex.org/W6637747991","https://openalex.org/W6640380507","https://openalex.org/W6645871506","https://openalex.org/W6663874485","https://openalex.org/W6664416801","https://openalex.org/W6665975182","https://openalex.org/W6670483363","https://openalex.org/W6682044434","https://openalex.org/W6682569942","https://openalex.org/W6683221596","https://openalex.org/W6683987471","https://openalex.org/W6689978535","https://openalex.org/W6691190440","https://openalex.org/W6697236513","https://openalex.org/W7011576691"],"related_works":["https://openalex.org/W2138676684","https://openalex.org/W2612663217","https://openalex.org/W189149726","https://openalex.org/W3094029073","https://openalex.org/W1506649542","https://openalex.org/W2799397541","https://openalex.org/W2027594761","https://openalex.org/W2009987517","https://openalex.org/W2741010003","https://openalex.org/W2621038882"],"abstract_inverted_index":{"EIGRP":[0],"and":[1,88],"some":[2],"other":[3],"routing":[4,10,72],"protocols":[5,73],"proposed":[6,18],"recently":[7],"attain":[8],"loop-free":[9,26],"by":[11],"using":[12],"diffusing":[13,34,60,76],"computations,":[14],"which":[15],"were":[16],"first":[17],"for":[19,25],"the":[20,57,68],"Diffusing":[21],"Update":[22],"Algorithm":[23],"(DUAL)":[24],"shortest":[27],"path":[28],"routing.":[29],"The":[30],"basic":[31],"approach":[32,55],"to":[33,56,67],"computations":[35,61],"used":[36,70],"in":[37,71,90],"DUAL":[38,87],"has":[39],"remained":[40],"unchanged":[41],"since":[42],"its":[43],"introduction":[44],"about":[45],"35":[46],"years":[47],"ago.":[48],"This":[49],"paper":[50],"presents":[51],"DARE,":[52],"a":[53],"new":[54],"implementation":[58],"of":[59],"that":[62,81],"does":[63],"not":[64],"require":[65],"changes":[66],"signaling":[69],"based":[74],"on":[75],"computations.":[77],"It":[78],"is":[79,83],"shown":[80],"DARE":[82],"much":[84],"simpler":[85],"than":[86],"results":[89],"faster":[91],"convergence":[92],"speeds.":[93]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2025-10-10T00:00:00"}