{"id":"https://openalex.org/W1989427854","doi":"https://doi.org/10.1145/1011767.1011859","title":"Brief announcement","display_name":"Brief announcement","publication_year":2004,"publication_date":"2004-07-25","ids":{"openalex":"https://openalex.org/W1989427854","doi":"https://doi.org/10.1145/1011767.1011859","mag":"1989427854"},"language":"en","primary_location":{"id":"doi:10.1145/1011767.1011859","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1011767.1011859","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual 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/A5084267145","display_name":"Gennaro Cordasco","orcid":"https://orcid.org/0000-0001-9148-9769"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Gennaro Cordasco","raw_affiliation_strings":["Universit\u00e1 di Salerno, Baronissi, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e1 di Salerno, Baronissi, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022392874","display_name":"Luisa Gargano","orcid":"https://orcid.org/0000-0003-3459-1075"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luisa Gargano","raw_affiliation_strings":["Universit\u00e1 di Salerno, Baronissi, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e1 di Salerno, Baronissi, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089036996","display_name":"Mikael Hammar","orcid":null},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Mikael Hammar","raw_affiliation_strings":["Universit\u00e1 di Salerno, Baronissi, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e1 di Salerno, Baronissi, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036057602","display_name":"Vittorio Scarano","orcid":"https://orcid.org/0000-0001-8437-5253"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Vittorio Scarano","raw_affiliation_strings":["Universit\u00e1 di Salerno, Baronissi, Italy"],"affiliations":[{"raw_affiliation_string":"Universit\u00e1 di Salerno, Baronissi, Italy","institution_ids":["https://openalex.org/I131729948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5084267145"],"corresponding_institution_ids":["https://openalex.org/I131729948"],"apc_list":null,"apc_paid":null,"fwci":0.6953,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75631102,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"395","last_page":"395"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10742","display_name":"Peer-to-Peer Network Technologies","score":1.0,"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":1.0,"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.9998000264167786,"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.9898999929428101,"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.6580053567886353},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5899468660354614},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5558120012283325},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5522682666778564},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.533921480178833},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.49030283093452454},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4761146008968353},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4647253155708313},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4276485741138458},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3624223470687866},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.34827208518981934},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.34040403366088867},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27126866579055786},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.26249295473098755}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6580053567886353},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5899468660354614},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5558120012283325},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5522682666778564},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.533921480178833},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.49030283093452454},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4761146008968353},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4647253155708313},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4276485741138458},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3624223470687866},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.34827208518981934},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.34040403366088867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27126866579055786},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.26249295473098755},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/1011767.1011859","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1011767.1011859","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1564854496","https://openalex.org/W2118428193","https://openalex.org/W2128678576","https://openalex.org/W2158049821","https://openalex.org/W2160405192","https://openalex.org/W2295289557"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2068473861","https://openalex.org/W2889464401","https://openalex.org/W2347665962","https://openalex.org/W757657516","https://openalex.org/W2351878639","https://openalex.org/W2539097916","https://openalex.org/W2351097701","https://openalex.org/W2162880363"],"abstract_inverted_index":{"Greedy":[0],"routing":[1,24,42,77,112,119,210,221,237,257],"has":[2,31,120],"been":[3,121],"used":[4],"in":[5,54,113,131,169,179,187,245,271,300,316],"most":[6,154],"of":[7,13,17,46,57,96,143,167,173,195,219,264,298,320,334],"the":[8,18,58,75,86,133,141,149,157,165,171,174,180,185,193,199,208,217,224,231,235,243,259,269,289,296,313,332],"proposed":[9,122],"P2P":[10],"networks":[11,101],"because":[12],"several":[14,188],"reasons.":[15],"One":[16],"main":[19],"advantages":[20,218],"is":[21,25,89,228],"that":[22,40,274],"greedy":[23,41,76,118,134,220],"very":[26],"simple":[27],"to":[28,99,212,214,229,261,311,329],"implement":[29],"and":[30,74,255,346],"some":[32,65,215],"\u201cimplicit\u201d":[33],"fault-tolerance":[34],"capabilities.":[35],"It":[36],"was":[37],"however":[38],"noticed":[39],"usually":[43],"produces":[44,78],"paths":[45],"length":[47,82],"larger":[48],"than":[49],"what":[50],"would":[51],"be":[52,277],"required":[53],"a":[55,108,144,262,321],"network":[56],"given":[59,233],"node":[60,145,158,263,302,328],"degree.":[61],"As":[62],"an":[63,79],"example":[64],"popular":[66],"topologies":[67],"like":[68],"Chord":[69],"have":[70],"degree":[71],"O(log":[72,83],"n)":[73,84],"average":[80,104],"path":[81,105],"whereas":[85],"lower":[87],"bound":[88],"\u03a9(log":[90],"n/log":[91],"log":[92],"n).":[93],"The":[94,160],"use":[95,166,194],"randomization":[97,168,254],"allowed":[98],"show":[100],"with":[102,164,207],"optimal":[103],"length.":[106],"Recently":[107],"novel":[109],"approach":[110,162],"for":[111],"DHTs":[114],"which":[115,176],"improves":[116],"on":[117],"[4].":[123],"This":[124],"approach,":[125],"called":[126],"NoN":[127,161,209,236,256],"(Neighbors\u2013of\u2013Neighbors),":[128],"substantially":[129],"consists":[130],"making":[132],"choice":[135],"by":[136,198,203,234,249,282,341,347],"looking":[137],"not":[138],"only":[139],"at":[140,147,151,153,291],"neighbors":[142,172,333],"but":[146],"all":[148,292],"nodes":[150,175],"distance":[152],"2":[155],"from":[156],"itself.":[159],"together":[163,206],"establishing":[170,317],"are":[177],"present":[178],"network,":[181],"can":[182,276],"optimally":[183],"reduce":[184],"latency":[186],"well":[189],"known":[190],"topologies.":[191],"Hence":[192],"randomization,":[196],"inspired":[197],"Small-world":[200],"idea":[201],"introduced":[202],"Kleinberg":[204],"[2],":[205],"allows":[211,326],"maintain,":[213],"extent,":[216],"while":[222,241],"optimizing":[223],"latency.":[225],"Our":[226],"goal":[227],"retain":[230],"improvements":[232],"over":[238],"randomized":[239],"networks,":[240],"eliminating":[242],"drawback":[244],"system":[246],"overhead":[247],"implied":[248],"this":[250,275,307],"technique.":[251],"In":[252,323],"fact,":[253,324],"require":[258],"transmission":[260],"its":[265,303,335],"neighbors\u2019s":[266,304],"neighbors.":[267,305,336],"While":[268],"authors":[270],"[4]":[272],"argue":[273],"done":[278],"without":[279],"extra":[280],"cost":[281],"using":[283],"keep-alive":[284],"TCP":[285],"messages,":[286],"we":[287,309],"eliminate":[288,295,312],"extracommunication":[290],"and,":[293],"similarly,":[294],"need":[297,310],"storing":[299],"each":[301,318,327],"To":[306],"aim":[308],"random":[314],"factor":[315],"neighbor":[319],"node.":[322],"determinism":[325],"calculate":[330],"locally":[331],"\u2217":[337],"Work":[338],"partially":[339],"supported":[340],"EU":[342],"RTN":[343],"project":[344,351],"ARACNE":[345],"Italian":[348],"FIRB":[349],"WEBMINDS":[350]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}