{"id":"https://openalex.org/W2810930637","doi":"https://doi.org/10.1145/3212734.3212761","title":"Near-Optimal Distributed Routing with Low Memory","display_name":"Near-Optimal Distributed Routing with Low Memory","publication_year":2018,"publication_date":"2018-07-23","ids":{"openalex":"https://openalex.org/W2810930637","doi":"https://doi.org/10.1145/3212734.3212761","mag":"2810930637"},"language":"en","primary_location":{"id":"doi:10.1145/3212734.3212761","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3212734.3212761","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","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/A5075683085","display_name":"Michael Elkin","orcid":"https://orcid.org/0000-0003-4257-2122"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Michael Elkin","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066182501","display_name":"Ofer Neiman","orcid":"https://orcid.org/0000-0003-4179-4364"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ofer Neiman","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075683085"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":1.5045,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.84433183,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"207","last_page":"216"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9987999796867371,"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.7504194974899292},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5947627425193787},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.44496819376945496},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.44449272751808167},{"id":"https://openalex.org/keywords/aka","display_name":"AKA","score":0.4128965139389038},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.38542640209198},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.37021052837371826},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36368507146835327},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.330095499753952},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21842294931411743},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.19173508882522583},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07213267683982849}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7504194974899292},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5947627425193787},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.44496819376945496},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.44449272751808167},{"id":"https://openalex.org/C121158502","wikidata":"https://www.wikidata.org/wiki/Q4652161","display_name":"AKA","level":2,"score":0.4128965139389038},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.38542640209198},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.37021052837371826},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36368507146835327},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.330095499753952},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21842294931411743},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.19173508882522583},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07213267683982849},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3212734.3212761","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3212734.3212761","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.4699999988079071}],"awards":[{"id":"https://openalex.org/G2083611340","display_name":null,"funder_award_id":"2015813","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"},{"id":"https://openalex.org/G2344932101","display_name":null,"funder_award_id":"724/15 and 1817/17","funder_id":"https://openalex.org/F4320320950","funder_display_name":"United States-Israel Binational Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320320950","display_name":"United States-Israel Binational Science Foundation","ror":"https://ror.org/00j8z2m73"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1967359086","https://openalex.org/W2005580106","https://openalex.org/W2006383304","https://openalex.org/W2020965855","https://openalex.org/W2033112846","https://openalex.org/W2040011014","https://openalex.org/W2040273581","https://openalex.org/W2057994027","https://openalex.org/W2077824753","https://openalex.org/W2083323175","https://openalex.org/W2091569826","https://openalex.org/W2093455937","https://openalex.org/W2112702616","https://openalex.org/W2152383935","https://openalex.org/W2476434590","https://openalex.org/W2592613193","https://openalex.org/W2610522381","https://openalex.org/W2793130010","https://openalex.org/W2951926403","https://openalex.org/W2963618817"],"related_works":["https://openalex.org/W3014541132","https://openalex.org/W2994737807","https://openalex.org/W2948639032","https://openalex.org/W2948704552","https://openalex.org/W2948403110","https://openalex.org/W3156494719","https://openalex.org/W2909288185","https://openalex.org/W2948123712","https://openalex.org/W2105586767","https://openalex.org/W2127783792"],"abstract_inverted_index":{"Distributed":[0,16],"\\em":[1,131],"routing":[2,55,69,101,133],"is":[3,93],"one":[4,107],"of":[5,15,75,100,146,168,173,182],"the":[6,13,28,50,54,73,86,95,98,106,110,113,116,128,157,180,183],"most":[7],"central":[8],"and":[9,57,62,82,91,103,109,141,144,150,165,171],"fundamental":[10],"problems":[11],"in":[12],"area":[14],"Graph":[17],"Algorithms.":[18],"It":[19],"was":[20],"extensively":[21],"studied":[22],"for":[23,32,127],"almost":[24],"thirty":[25],"years.":[26],"Nevertheless,":[27],"currently":[29],"existing":[30,125],"solutions":[31,126,136],"this":[33,119],"problem":[34],"require":[35,137],"either":[36,48],"prohibitively":[37,44],"large":[38,45],"construction":[39,51,80,87],"(aka":[40],"preprocessing)":[41],"time,":[42],"or":[43,52],"memory":[46,83],"usage":[47],"during":[49,53,85],"phase,":[56],"suffer":[58],"from":[59],"suboptimal":[60],"labels":[61,104,145,172],"tables'":[63],"sizes.":[64],"We":[65],"devise":[66],"a":[67],"distributed":[68,129],"scheme":[70],"that":[71],"enjoys":[72],"best":[74],"all":[76],"worlds.":[77],"Specifically,":[78],"its":[79],"time":[81],"requirements":[84],"phase":[88],"are":[89],"near-optimal,":[90],"so":[92],"also":[94,122],"tradeoff":[96],"between":[97],"sizes":[99],"tables":[102,143,167],"on":[105,112,156],"hand,":[108,159],"stretch":[111],"other.":[114],"On":[115],"way":[117],"to":[118],"result,":[120],"we":[121],"improve":[123],"upon":[124],"exact":[130],"tree":[132],"problem.":[134],"Previous":[135],"\u03a9(\u221a":[138],")":[139],"memory,":[140,164],"provide":[142],"size":[147,169,174],"O(log":[148,162,175],"n)":[149,163],"O(log^2":[151],"n),":[152],"respectively.":[153],"Our":[154],"solution,":[155],"other":[158],"requires":[160],"just":[161],"has":[166],"O(1),":[170],"n).":[176],"These":[177],"bounds":[178,181],"match":[179],"best-known":[184],"centralized":[185],"solution.":[186]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-25T08:39:21.599409","created_date":"2025-10-10T00:00:00"}