{"id":"https://openalex.org/W2101337120","doi":"https://doi.org/10.1145/1073970.1073991","title":"Fast construction of overlay networks","display_name":"Fast construction of overlay networks","publication_year":2005,"publication_date":"2005-07-18","ids":{"openalex":"https://openalex.org/W2101337120","doi":"https://doi.org/10.1145/1073970.1073991","mag":"2101337120"},"language":"en","primary_location":{"id":"doi:10.1145/1073970.1073991","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073970.1073991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures","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/A5022630792","display_name":"Dana Angluin","orcid":"https://orcid.org/0000-0002-6907-2999"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dana Angluin","raw_affiliation_strings":["Yale University, New Haven, CT","YALE UNIVERSITY, New Haven, CT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"YALE UNIVERSITY, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036421091","display_name":"James Aspnes","orcid":"https://orcid.org/0000-0001-6188-1663"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James Aspnes","raw_affiliation_strings":["Yale University, New Haven, CT","YALE UNIVERSITY, New Haven, CT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"YALE UNIVERSITY, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065199727","display_name":"Chen Jiang","orcid":"https://orcid.org/0000-0003-0562-6240"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiang Chen","raw_affiliation_strings":["Yale University, New Haven, CT","YALE UNIVERSITY, New Haven, CT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"YALE UNIVERSITY, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007162282","display_name":"Yinghua Wu","orcid":"https://orcid.org/0000-0001-9116-1624"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yinghua Wu","raw_affiliation_strings":["Yale University, New Haven, CT","YALE UNIVERSITY, New Haven, CT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"YALE UNIVERSITY, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101513638","display_name":"Yitong Yin","orcid":"https://orcid.org/0000-0001-9204-7794"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yitong Yin","raw_affiliation_strings":["Yale University, New Haven, CT","YALE UNIVERSITY, New Haven, CT"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"YALE UNIVERSITY, New Haven, CT","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":3.9233,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.94861739,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"145","last_page":"154"},"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.9998999834060669,"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.9998999834060669,"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.9973000288009644,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9121999740600586,"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.6878775954246521},{"id":"https://openalex.org/keywords/identifier","display_name":"Identifier","score":0.6573010683059692},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6332108974456787},{"id":"https://openalex.org/keywords/overlay-network","display_name":"Overlay network","score":0.5936092734336853},{"id":"https://openalex.org/keywords/chord","display_name":"Chord (peer-to-peer)","score":0.5645835995674133},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5592392683029175},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5583081841468811},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.5191692113876343},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.5117449760437012},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4762803912162781},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46869611740112305},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4610947370529175},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4214288294315338},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4112115502357483},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.38805851340293884},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38547971844673157},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30991166830062866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27774113416671753}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6878775954246521},{"id":"https://openalex.org/C154504017","wikidata":"https://www.wikidata.org/wiki/Q853614","display_name":"Identifier","level":2,"score":0.6573010683059692},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6332108974456787},{"id":"https://openalex.org/C169851745","wikidata":"https://www.wikidata.org/wiki/Q1331985","display_name":"Overlay network","level":3,"score":0.5936092734336853},{"id":"https://openalex.org/C194147245","wikidata":"https://www.wikidata.org/wiki/Q1076368","display_name":"Chord (peer-to-peer)","level":2,"score":0.5645835995674133},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5592392683029175},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5583081841468811},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.5191692113876343},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.5117449760437012},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4762803912162781},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46869611740112305},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4610947370529175},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4214288294315338},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4112115502357483},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.38805851340293884},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38547971844673157},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30991166830062866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27774113416671753},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1073970.1073991","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1073970.1073991","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.220.427","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.yale.edu/~aspnes/spaa2005-construction.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1531273380","https://openalex.org/W1553412508","https://openalex.org/W1844402788","https://openalex.org/W1964932074","https://openalex.org/W2015771569","https://openalex.org/W2016995838","https://openalex.org/W2019526545","https://openalex.org/W2023492687","https://openalex.org/W2039096025","https://openalex.org/W2071294844","https://openalex.org/W2077371116","https://openalex.org/W2092423448","https://openalex.org/W2104628140","https://openalex.org/W2113623403","https://openalex.org/W2118428193","https://openalex.org/W2127005994","https://openalex.org/W2133323743","https://openalex.org/W2143411260","https://openalex.org/W2143462372","https://openalex.org/W2155512447","https://openalex.org/W2158049821","https://openalex.org/W2337480916","https://openalex.org/W6679196246","https://openalex.org/W6696924551"],"related_works":["https://openalex.org/W4378651134","https://openalex.org/W229552792","https://openalex.org/W2351864507","https://openalex.org/W3215212221","https://openalex.org/W2074617146","https://openalex.org/W2372238395","https://openalex.org/W2355592661","https://openalex.org/W1971283835","https://openalex.org/W2350952676","https://openalex.org/W2136838521"],"abstract_inverted_index":{"An":[0],"asynchronous":[1],"algorithm":[2,128],"is":[3,49,84,97,153,186],"described":[4],"for":[5,67,141,155],"rapidly":[6],"constructing":[7],"an":[8,27],"overlay":[9,71],"network":[10],"in":[11,19,111,162],"a":[12,39,50,65,94,102,163,169,173],"peer-to-peer":[13],"system":[14],"where":[15],"all":[16,54],"nodes":[17,107],"can":[18,61],"principle":[20],"communicate":[21],"with":[22,86],"each":[23,31],"other":[24,42],"directly":[25],"through":[26],"underlying":[28],"network,":[29],"but":[30],"participating":[32],"node":[33,95],"initially":[34],"has":[35,129],"pointers":[36],"to":[37,195],"only":[38,137],"handful":[40],"of":[41,46,53,93,106,108,122,148,159,177],"participants.":[43],"The":[44],"output":[45],"the":[47,80,91,99,127,156],"mechanism":[48,100],"linked":[51],"list":[52,171],"participants":[55],"sorted":[56,170],"by":[57,192],"their":[58],"identifiers,":[59],"which":[60],"be":[62,190],"used":[63],"as":[64,74],"foundation":[66],"building":[68],"various":[69],"linear":[70],"networks":[72],"such":[73],"Chord":[75],"or":[76],"skip":[77],"graphs.":[78],"Assuming":[79],"initial":[81],"pointer":[82],"graph":[83,176],"weakly-connected":[85,175],"maximum":[87],"degree":[88],"d":[89],"and":[90,188],"length":[92],"identifier":[96],"W,":[98],"constructs":[101],"binary":[103],"search":[104],"tree":[105],"depth":[109],"O(W)":[110,124],"expected":[112,118],"O(W":[113],"log":[114,151],"n)":[115,120,152],"time":[116,134,158],"using":[117],"O((d+W)nlog":[119],"messages":[121,140],"size":[123],"each.":[125],"Furthermore,":[126],"low":[130],"contention:":[131],"at":[132],"any":[133,142,160],"there":[135],"are":[136],"O(d)":[138],"undelivered":[139],"given":[143,154],"recipient.":[144],"A":[145],"lower":[146,184],"bound":[147,185],"\u2126(d":[149],"+":[150],"running":[157],"procedure":[161],"related":[164],"synchronous":[165],"model":[166],"that":[167,182],"yields":[168],"from":[172],"degree-d":[174],"n":[178],"nodes.":[179],"We":[180],"conjecture":[181],"this":[183],"tight":[187],"could":[189],"attained":[191],"further":[193],"improvements":[194],"our":[196],"algorithms.":[197]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}