{"id":"https://openalex.org/W2066256226","doi":"https://doi.org/10.1145/1582716.1582756","title":"Bounding the locality of distributed routing algorithms","display_name":"Bounding the locality of distributed routing algorithms","publication_year":2009,"publication_date":"2009-08-10","ids":{"openalex":"https://openalex.org/W2066256226","doi":"https://doi.org/10.1145/1582716.1582756","mag":"2066256226"},"language":"en","primary_location":{"id":"doi:10.1145/1582716.1582756","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1582716.1582756","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th 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/A5013674788","display_name":"Prosenjit Bose","orcid":"https://orcid.org/0000-0002-8906-0573"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Prosenjit Bose","raw_affiliation_strings":["Carleton University, Ottawa, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Carleton University, Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026094478","display_name":"Paz Carmi","orcid":"https://orcid.org/0000-0003-0154-5013"},"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":"Paz Carmi","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"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/A5068826527","display_name":"St\u00e9phane Durocher","orcid":"https://orcid.org/0000-0002-6589-3538"},"institutions":[{"id":"https://openalex.org/I46247651","display_name":"University of Manitoba","ror":"https://ror.org/02gfys938","country_code":"CA","type":"education","lineage":["https://openalex.org/I46247651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stephane Durocher","raw_affiliation_strings":["University of Manitoba, Winnipeg, MAN, Canada","University of Manitoba, Winnipeg, Man., Canada"],"affiliations":[{"raw_affiliation_string":"University of Manitoba, Winnipeg, MAN, Canada","institution_ids":["https://openalex.org/I46247651"]},{"raw_affiliation_string":"University of Manitoba, Winnipeg, Man., Canada","institution_ids":["https://openalex.org/I46247651"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5013674788"],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":null,"apc_paid":null,"fwci":1.3714,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.82183355,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"250","last_page":"259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9995999932289124,"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.9995999932289124,"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.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9950000047683716,"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/locality","display_name":"Locality","score":0.692141056060791},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.6646032333374023},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6488182544708252},{"id":"https://openalex.org/keywords/dilation","display_name":"Dilation (metric space)","score":0.5615324974060059},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5157127976417542},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4919271469116211},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.48529714345932007},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.46026355028152466},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4336153566837311},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4219313859939575},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.4215720593929291},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4152992069721222},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36422860622406006},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3531246781349182},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3489750623703003},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.316616415977478},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3125636577606201},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3005473017692566},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3004775047302246}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.692141056060791},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.6646032333374023},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6488182544708252},{"id":"https://openalex.org/C2780757906","wikidata":"https://www.wikidata.org/wiki/Q5276676","display_name":"Dilation (metric space)","level":2,"score":0.5615324974060059},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5157127976417542},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4919271469116211},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.48529714345932007},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.46026355028152466},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4336153566837311},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4219313859939575},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.4215720593929291},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4152992069721222},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36422860622406006},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3531246781349182},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3489750623703003},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.316616415977478},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3125636577606201},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3005473017692566},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3004775047302246},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1582716.1582756","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1582716.1582756","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM symposium on Principles of distributed computing","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":29,"referenced_works":["https://openalex.org/W1502860253","https://openalex.org/W1518780012","https://openalex.org/W1527244369","https://openalex.org/W1550444125","https://openalex.org/W1554613743","https://openalex.org/W1594591983","https://openalex.org/W1963621086","https://openalex.org/W1968698408","https://openalex.org/W1970346886","https://openalex.org/W1983880253","https://openalex.org/W1990277587","https://openalex.org/W1991764368","https://openalex.org/W2005720152","https://openalex.org/W2007232927","https://openalex.org/W2065248207","https://openalex.org/W2069471802","https://openalex.org/W2091569826","https://openalex.org/W2108558002","https://openalex.org/W2116000736","https://openalex.org/W2119251691","https://openalex.org/W2120296177","https://openalex.org/W2122684646","https://openalex.org/W2145636443","https://openalex.org/W2145885111","https://openalex.org/W2151358465","https://openalex.org/W2156689181","https://openalex.org/W2166576909","https://openalex.org/W2171151410","https://openalex.org/W6632945411"],"related_works":["https://openalex.org/W1655019438","https://openalex.org/W2555559350","https://openalex.org/W2120137201","https://openalex.org/W1975971517","https://openalex.org/W2950120971","https://openalex.org/W2543752581","https://openalex.org/W2620451430","https://openalex.org/W2128948913","https://openalex.org/W4394645426","https://openalex.org/W1967187908"],"abstract_inverted_index":{"We":[0],"examine":[1],"bounds":[2,117,137],"on":[3,103,118,138],"the":[4,33,48,66,70,81,121],"locality":[5],"of":[6,15,20,58,63,76,89,123,130,143],"routing.":[7],"A":[8],"local":[9,26,98],"routing":[10,99,126],"algorithm":[11],"makes":[12],"a":[13,37,104,108],"sequence":[14],"distributed":[16],"forwarding":[17],"decisions,":[18],"each":[19],"which":[21,36,69,75,88],"is":[22,39,85],"made":[23],"using":[24],"only":[25],"information.":[27],"Specifically,":[28],"in":[29],"addition":[30],"to":[31,51,86,96,147],"knowing":[32],"node":[34,43,67],"for":[35,60,120,127],"message":[38,71],"destined,":[40],"an":[41],"intermediate":[42],"might":[44],"also":[45],"know":[46],"a)":[47],"subgraph":[49],"corresponding":[50,136],"all":[52],"network":[53,105],"nodes":[54],"within":[55],"k":[56,101,119],"hops":[57],"itself,":[59],"some":[61],"value":[62],"k,":[64],"b)":[65],"from":[68],"originated,":[72],"and":[73],"c)":[74],"its":[77],"neighbours":[78],"last":[79],"forwarded":[80],"message.":[82],"Our":[83],"objective":[84],"determine":[87],"these":[90,131],"parameters":[91],"are":[92],"necessary":[93],"and/or":[94],"sufficient":[95],"permit":[97],"as":[100,133,135],"varies":[102],"modelled":[106],"by":[107],"connected":[109],"undirected":[110],"graph.":[111],"In":[112],"particular,":[113],"we":[114],"establish":[115],"tight":[116],"feasibility":[122],"deterministic":[124],"k-local":[125],"various":[128],"combinations":[129],"parameters,":[132],"well":[134],"dilation":[139],"(the":[140],"worst-case":[141],"ratio":[142],"actual":[144],"route":[145],"length":[146],"shortest":[148],"path":[149],"length).":[150]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}