{"id":"https://openalex.org/W2072592698","doi":"https://doi.org/10.1007/s00446-012-0179-3","title":"Bounding the locality of distributed routing algorithms","display_name":"Bounding the locality of distributed routing algorithms","publication_year":2012,"publication_date":"2012-09-10","ids":{"openalex":"https://openalex.org/W2072592698","doi":"https://doi.org/10.1007/s00446-012-0179-3","mag":"2072592698"},"language":"en","primary_location":{"id":"doi:10.1007/s00446-012-0179-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00446-012-0179-3","pdf_url":null,"source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed Computing","raw_type":"journal-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":["School of Computer Science, Carleton University, Ottawa, Canada","(Carleton University)"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carleton University, Ottawa, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"(Carleton University)","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":["Department of Computer Science, Ben-Gurion University of the Negev, Beersheba, Israel","Ben Gurion University of the Negev"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Ben-Gurion University of the Negev, Beersheba, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Ben Gurion University of the Negev","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":["Department of Computer Science, University of Manitoba, Winnipeg, Canada","University of Manitoba"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Manitoba, Winnipeg, Canada","institution_ids":["https://openalex.org/I46247651"]},{"raw_affiliation_string":"University of Manitoba","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":{"value":2490,"currency":"EUR","value_usd":3090},"apc_paid":null,"fwci":3.3793,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.92816814,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"26","issue":"1","first_page":"39","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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"}},"topics":[{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","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/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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9958000183105469,"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/locality","display_name":"Locality","score":0.6225624084472656},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.603255033493042},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5892317295074463},{"id":"https://openalex.org/keywords/dilation","display_name":"Dilation (metric space)","score":0.5033592581748962},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4761490821838379},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.47309568524360657},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.466946005821228},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.4374730885028839},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.433454692363739},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4009090065956116},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36282414197921753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35288119316101074},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3519570827484131},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34752023220062256},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30138033628463745},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.2443637251853943},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24343371391296387}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.6225624084472656},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.603255033493042},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5892317295074463},{"id":"https://openalex.org/C2780757906","wikidata":"https://www.wikidata.org/wiki/Q5276676","display_name":"Dilation (metric space)","level":2,"score":0.5033592581748962},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4761490821838379},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.47309568524360657},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.466946005821228},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.4374730885028839},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.433454692363739},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4009090065956116},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36282414197921753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35288119316101074},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3519570827484131},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34752023220062256},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30138033628463745},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.2443637251853943},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24343371391296387},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/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.1007/s00446-012-0179-3","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00446-012-0179-3","pdf_url":null,"source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Distributed Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1502860253","https://openalex.org/W1518780012","https://openalex.org/W1550444125","https://openalex.org/W1554613743","https://openalex.org/W1963621086","https://openalex.org/W1968698408","https://openalex.org/W1983880253","https://openalex.org/W1990277587","https://openalex.org/W1991764368","https://openalex.org/W2007232927","https://openalex.org/W2065248207","https://openalex.org/W2066256226","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/W4206502907","https://openalex.org/W4249052652"],"related_works":["https://openalex.org/W4293488959","https://openalex.org/W2952913234","https://openalex.org/W4299830794","https://openalex.org/W2126587030","https://openalex.org/W2166606842","https://openalex.org/W2111009930","https://openalex.org/W2936947186","https://openalex.org/W2543286347","https://openalex.org/W2066256226","https://openalex.org/W2072592698"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}