{"id":"https://openalex.org/W2160405192","doi":"https://doi.org/10.1145/1007352.1007368","title":"Know thy neighbor's neighbor","display_name":"Know thy neighbor's neighbor","publication_year":2004,"publication_date":"2004-06-13","ids":{"openalex":"https://openalex.org/W2160405192","doi":"https://doi.org/10.1145/1007352.1007368","mag":"2160405192"},"language":"en","primary_location":{"id":"doi:10.1145/1007352.1007368","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5022543825","display_name":"Gurmeet Singh Manku","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gurmeet Singh Manku","raw_affiliation_strings":["Stanford University, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002372704","display_name":"Moni Naor","orcid":"https://orcid.org/0000-0003-3381-0221"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Moni Naor","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025142058","display_name":"Udi Wieder","orcid":null},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Udi Wieder","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.9918,"has_fulltext":false,"cited_by_count":208,"citation_normalized_percentile":{"value":0.99250702,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"54","last_page":"63"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9997000098228455,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9997000098228455,"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/T11478","display_name":"Caching and Content Delivery","score":0.9987000226974487,"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.9660999774932861,"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/hypercube","display_name":"Hypercube","score":0.5802881717681885},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5723978877067566},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.537659227848053},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5005631446838379},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.49616608023643494},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4753546416759491},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.46030759811401367},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.438503623008728},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43505915999412537},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.3566330671310425},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.349884957075119},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.31765878200531006},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16023984551429749},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.14929842948913574}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5802881717681885},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5723978877067566},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.537659227848053},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5005631446838379},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.49616608023643494},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4753546416759491},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.46030759811401367},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.438503623008728},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43505915999412537},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.3566330671310425},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.349884957075119},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.31765878200531006},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16023984551429749},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.14929842948913574}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1007352.1007368","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1007352.1007368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-sixth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W1486176979","https://openalex.org/W1492552531","https://openalex.org/W1523214132","https://openalex.org/W1533883536","https://openalex.org/W1544470013","https://openalex.org/W1564854496","https://openalex.org/W1573579329","https://openalex.org/W1601823992","https://openalex.org/W1658310351","https://openalex.org/W1968939650","https://openalex.org/W1970564778","https://openalex.org/W1981535405","https://openalex.org/W1992467531","https://openalex.org/W1994593142","https://openalex.org/W1996639901","https://openalex.org/W1997454227","https://openalex.org/W2042587503","https://openalex.org/W2049794981","https://openalex.org/W2053634345","https://openalex.org/W2058839687","https://openalex.org/W2070219632","https://openalex.org/W2070991879","https://openalex.org/W2088668624","https://openalex.org/W2096706512","https://openalex.org/W2101267973","https://openalex.org/W2112090702","https://openalex.org/W2123482462","https://openalex.org/W2128678576","https://openalex.org/W2142418251","https://openalex.org/W2142887429","https://openalex.org/W2152118092","https://openalex.org/W2158049821","https://openalex.org/W2163059190","https://openalex.org/W2167898414","https://openalex.org/W2295289557","https://openalex.org/W2325532214","https://openalex.org/W3004472923","https://openalex.org/W3088048311","https://openalex.org/W3152095332","https://openalex.org/W4245443116","https://openalex.org/W6633622679","https://openalex.org/W6634264458","https://openalex.org/W6668357483","https://openalex.org/W6677090979","https://openalex.org/W6681144085","https://openalex.org/W6696924551"],"related_works":["https://openalex.org/W2122343781","https://openalex.org/W2123417578","https://openalex.org/W2036758175","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W3097369619","https://openalex.org/W1994598067","https://openalex.org/W2061496873","https://openalex.org/W2011106535","https://openalex.org/W2963622642"],"abstract_inverted_index":{"Several":[0],"peer-to-peer":[1],"networks":[2,99,115],"are":[3],"based":[4,23,123],"upon":[5,24],"randomized":[6,16,18,117,119],"graph":[7],"topologies":[8],"that":[9],"permit":[10],"efficient":[11],"greedy":[12,48,63,109,158],"routing,":[13],"e.":[14],"g.,":[15],"hypercubes,":[17,118],"Chord,":[19,120],"skip-graphs":[20],"and":[21,47,68,102,108,121],"constructions":[22,122],"small-world":[25,125],"percolation":[26,126],"networks.":[27],"In":[28,153],"each":[29],"of":[30,45,142,155],"these":[31,66,156],"networks,":[32,67,127,157],"a":[33,84],"node":[34],"has":[35],"out-degree":[36],"\u0398(log":[37,106,130,147,183],"n),":[38],"where":[39],"n":[40,131,148,184],"denotes":[41],"the":[42,78,173],"total":[43],"number":[44],"nodes,":[46],"routing":[49,64,92,98,110,114,159,175],"is":[50,81,111,145,177,191],"known":[51],"to":[52,82,161,179,182],"take":[53,83],"O(log":[54],"n)":[55,107,135,167,188],"hops":[56,168],"on":[57,124],"average.":[58],"We":[59],"establish":[60],"lower-bounds":[61],"for":[62,65,89],"analyze":[69],"Neighbor-of-Neighbor":[70],"(NoN)-greedy":[71],"routing.":[72],"The":[73,139],"idea":[74],"behind":[75],"NoN,":[76],"as":[77],"name":[79],"suggests,":[80],"neighbor's":[85],"neighbors":[86],"into":[87],"account":[88],"making":[90],"better":[91],"decisions.The":[93],"following":[94],"picture":[95],"emerges:":[96],"Deterministic":[97],"like":[100,116],"hypercubes":[101],"Chord":[103],"have":[104,128],"diameter":[105,129,141],"optimal.":[112,193],"Randomized":[113],"/":[132,149,185],"log":[133,134,150,151,186,187],"with":[136,169],"high":[137,170],"probability.":[138,171],"expected":[140],"Skip":[143],"graphs":[144],"also":[146],"n).":[152],"all":[154],"fails":[160],"find":[162],"short":[163],"routes,":[164],"requiring":[165],"\u03a9(log":[166],"Surprisingly,":[172],"NoN-greedy":[174],"algorithm":[176],"able":[178],"diminish":[180],"route-lengths":[181],"hops,":[189],"which":[190],"asymptotically":[192]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":17},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}