{"id":"https://openalex.org/W2476434590","doi":"https://doi.org/10.1145/2933057.2933098","title":"On Efficient Distributed Construction of Near Optimal Routing Schemes","display_name":"On Efficient Distributed Construction of Near Optimal Routing Schemes","publication_year":2016,"publication_date":"2016-07-25","ids":{"openalex":"https://openalex.org/W2476434590","doi":"https://doi.org/10.1145/2933057.2933098","mag":"2476434590"},"language":"en","primary_location":{"id":"doi:10.1145/2933057.2933098","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 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, Beer Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University, 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, Beer Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University, 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.49760886,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.879314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"244"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6668288707733154},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6133012175559998},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.603042721748352},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5552260875701904},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5546619892120361},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5301113128662109},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4818774163722992},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4579445719718933},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4549720585346222},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.45216429233551025},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.44985896348953247},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44230806827545166},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42782318592071533},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.42577868700027466},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4244411289691925},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4161539673805237},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34457504749298096},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33517593145370483},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.25474411249160767},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21772855520248413},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.20675981044769287}],"concepts":[{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6668288707733154},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6133012175559998},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.603042721748352},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5552260875701904},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5546619892120361},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5301113128662109},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4818774163722992},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4579445719718933},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4549720585346222},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.45216429233551025},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.44985896348953247},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44230806827545166},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42782318592071533},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.42577868700027466},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4244411289691925},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4161539673805237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34457504749298096},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33517593145370483},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.25474411249160767},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21772855520248413},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.20675981044769287},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2933057.2933098","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2933057.2933098","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G2883294476","display_name":null,"funder_award_id":"303809","funder_id":"https://openalex.org/F4320334960","funder_display_name":"Seventh Framework Programme"},{"id":"https://openalex.org/G5379630855","display_name":null,"funder_award_id":"724/15 and 523/12","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320334960","display_name":"Seventh Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W634346220","https://openalex.org/W816673839","https://openalex.org/W1497938971","https://openalex.org/W1534484868","https://openalex.org/W1602024640","https://openalex.org/W1984090926","https://openalex.org/W2006383304","https://openalex.org/W2015819397","https://openalex.org/W2020965855","https://openalex.org/W2030982625","https://openalex.org/W2033112846","https://openalex.org/W2035494495","https://openalex.org/W2040011014","https://openalex.org/W2040273581","https://openalex.org/W2045446569","https://openalex.org/W2057994027","https://openalex.org/W2077824753","https://openalex.org/W2083323175","https://openalex.org/W2085630237","https://openalex.org/W2091569826","https://openalex.org/W2107282727","https://openalex.org/W2112702616","https://openalex.org/W2115833060","https://openalex.org/W2120994821","https://openalex.org/W2141653564","https://openalex.org/W2152383935","https://openalex.org/W2163097371","https://openalex.org/W2793130010","https://openalex.org/W2952490263","https://openalex.org/W2963618817","https://openalex.org/W3100139999"],"related_works":["https://openalex.org/W2349715051","https://openalex.org/W2386369498","https://openalex.org/W4385819622","https://openalex.org/W2347665962","https://openalex.org/W2162880363","https://openalex.org/W2351097701","https://openalex.org/W2317653264","https://openalex.org/W2120750391","https://openalex.org/W2509718831","https://openalex.org/W1996079847"],"abstract_inverted_index":{"Given":[0],"a":[1,6,15,20,25,79,97,110],"distributed":[2,21,111],"network":[3],"represented":[4],"by":[5,116],"weighted":[7],"undirected":[8],"graph":[9],"G=(V,E)":[10],"on":[11,78],"n":[12],"vertices,":[13],"and":[14,73,120],"parameter":[16],"k,":[17],"we":[18],"devise":[19],"algorithm":[22],"that":[23],"computes":[24],"routing":[26,60,93,107,134],"scheme":[27,55],"in":[28,96,109],"O(n1/2+1/k+D)\u22c5":[29],"no(1)":[30],"rounds,":[31],"where":[32],"D":[33],"is":[34,76],"the":[35,38,45,66,90,140],"hop-diameter":[36],"of":[37,48,63,69,136,146],"network.":[39],"The":[40,59,101,124],"running":[41,144],"time":[42,145],"nearly":[43,88],"matches":[44,89],"lower":[46],"bound":[47],"\u03a9(n1/2+D)":[49],"rounds":[50],"(which":[51],"holds":[52],"for":[53,92,105],"any":[54],"with":[56],"polynomial":[57],"stretch).":[58],"tables":[61,108,135],"are":[62,68],"size":[64,70,137],"\u00d5(n1/k),":[65],"labels":[67],"O(k":[71],"log2n),":[72],"every":[74],"packet":[75],"routed":[77],"path":[80],"suffering":[81],"stretch":[82],"at":[83],"most":[84],"4k-5+o(1).":[85],"Our":[86],"construction":[87],"state-of-the-art":[91],"schemes":[94],"built":[95],"centralized":[98],"sequential":[99],"manner.":[100],"previous":[102],"best":[103],"algorithms":[104],"building":[106],"small":[112],"messages":[113],"model":[114],"were":[115],"[LP13a,":[117],"STOC":[118],"2013]":[119],"[LP15,":[121],"PODC":[122],"2015].":[123],"former":[125],"has":[126,142],"similar":[127],"properties":[128],"but":[129],"suffers":[130],"from":[131],"substantially":[132],"larger":[133],"O(n1/2+1/k),":[138],"while":[139],"latter":[141],"sub-optimal":[143],"\u00d5(min{(nD)1/2":[147],"\u22c5":[148],"n1/k,n2/3+2/(3k)+D}).":[149]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}