{"id":"https://openalex.org/W2116773591","doi":"https://doi.org/10.1109/nca.2005.1","title":"A Concentric Multi-ring Overlay for Highly Reliable P2P Networks","display_name":"A Concentric Multi-ring Overlay for Highly Reliable P2P Networks","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2116773591","doi":"https://doi.org/10.1109/nca.2005.1","mag":"2116773591"},"language":"en","primary_location":{"id":"doi:10.1109/nca.2005.1","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nca.2005.1","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fourth IEEE International Symposium on Network Computing and Applications","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/A5054897452","display_name":"Giscard Wepiw\u00e9","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"G. Wepiwe","raw_affiliation_strings":["Faculty of Electrical Engineering and Computer Science, Technische Universitat Berlin-DAI-Labor, Berlin, Germany","Fac. of Electr. Eng. & Comput. Sci., Technische Univ. Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computer Science, Technische Universitat Berlin-DAI-Labor, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"Fac. of Electr. Eng. & Comput. Sci., Technische Univ. Berlin","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072156175","display_name":"Plamen L. Simeonov","orcid":"https://orcid.org/0000-0003-2672-4405"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"P.L. Simeonov","raw_affiliation_strings":["Faculty of Electrical Engineering and Computer Science, Technische Universitat Berlin-DAI-Labor, Berlin, Germany","Fac. of Electr. Eng. & Comput. Sci., Technische Univ. Berlin"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering and Computer Science, Technische Universitat Berlin-DAI-Labor, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"Fac. of Electr. Eng. & Comput. Sci., Technische Univ. Berlin","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":1.3697,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.84877,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"83","last_page":"90"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9919999837875366,"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/de-bruijn-sequence","display_name":"De Bruijn sequence","score":0.7969034910202026},{"id":"https://openalex.org/keywords/overlay-network","display_name":"Overlay network","score":0.723606526851654},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7082552909851074},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5849356055259705},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5181276202201843},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.509727418422699},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.47455817461013794},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.46689972281455994},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.46627524495124817},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4628227651119232},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.460616797208786},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.46060922741889954},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4497808516025543},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.4473254382610321},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.417336642742157},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.35266995429992676},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2754347324371338},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2530754804611206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22275331616401672},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22223877906799316}],"concepts":[{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.7969034910202026},{"id":"https://openalex.org/C169851745","wikidata":"https://www.wikidata.org/wiki/Q1331985","display_name":"Overlay network","level":3,"score":0.723606526851654},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7082552909851074},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5849356055259705},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5181276202201843},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.509727418422699},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.47455817461013794},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.46689972281455994},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.46627524495124817},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4628227651119232},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.460616797208786},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.46060922741889954},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4497808516025543},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.4473254382610321},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.417336642742157},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.35266995429992676},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2754347324371338},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2530754804611206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22275331616401672},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22223877906799316},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/nca.2005.1","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nca.2005.1","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fourth IEEE International Symposium on Network Computing and Applications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5199999809265137,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W600100310","https://openalex.org/W1523214132","https://openalex.org/W1970564778","https://openalex.org/W2016081037","https://openalex.org/W2058839687","https://openalex.org/W2074470639","https://openalex.org/W2097089313","https://openalex.org/W2112597136","https://openalex.org/W2123482462","https://openalex.org/W2134261469","https://openalex.org/W2152118092","https://openalex.org/W2158049821","https://openalex.org/W2163059190","https://openalex.org/W2163380088","https://openalex.org/W2165840727","https://openalex.org/W2167898414","https://openalex.org/W2951098997","https://openalex.org/W3162105941","https://openalex.org/W4250390143","https://openalex.org/W4252917781","https://openalex.org/W6631152430","https://openalex.org/W6676648991"],"related_works":["https://openalex.org/W2039773446","https://openalex.org/W1982188423","https://openalex.org/W1998243779","https://openalex.org/W4286247391","https://openalex.org/W2963500742","https://openalex.org/W1821276435","https://openalex.org/W2090085098","https://openalex.org/W12027773","https://openalex.org/W2290341137","https://openalex.org/W2130383043"],"abstract_inverted_index":{"The":[0],"paper":[1],"presents":[2],"a":[3,25,42,71,79,83,167,195],"concentric":[4],"multi-ring":[5],"overlay":[6,40],"networking":[7],"topology":[8],"for":[9,56,106],"fast":[10],"and":[11,66,174],"shortest-path":[12],"resource":[13,116],"discovery":[14],"in":[15,47,99,117,152,192],"dynamic":[16],"distributed":[17],"systems":[18],"like":[19],"P2P":[20,28,156],"network.":[21],"First,":[22],"we":[23,53,103,183],"de?ne":[24],"highly":[26,72,168],"reliable":[27,73],"system":[29],"called":[30],"HiPeer,":[31],"which":[32],"is":[33,139],"deployed":[34],"on":[35,159],"top":[36],"of":[37,44,49,61,85,93,97,200,204],"the":[38,94,100,118,143,148,153,160,175,201],"logical":[39],"with":[41,82,109,171],"number":[43,95],"lowest":[45,176],"bounds":[46],"terms":[48],"network":[50,108,119,170],"performance.":[51],"Then,":[52],"demonstrate":[54],"that":[55,105,185],"any":[57,107,114,186],"De":[58,161],"Bruijn":[59,162],"digraph":[60],"degree1":[62],"d":[63,112,173],"=":[64,127],"2":[65],"diameter2":[67],"DDB,":[68],"HiPeer":[69,165,193],"constructs":[70],"network,":[74],"where":[75],"each":[76],"node":[77],"maintains":[78],"routing":[80],"table":[81],"size":[84],"at":[86,110,124],"most":[87,111,125],"2d":[88],"+":[89,132],"3":[90],"entries":[91],"independent":[92],"N":[96],"nodes":[98],"system.":[101],"Further,":[102],"show":[104,184],"nodes,":[113],"existing":[115],"can":[120],"be":[121],"found":[122],"within":[123],"DHiPeer":[126],"logd":[128],"(N(d":[129],"-":[130,134],"1)":[131],"d)":[133],"1":[135],"hops.":[136],"This":[137],"result":[138],"as":[140,147],"close":[141],"to":[142],"Moore":[144],"bound":[145,180],"[9]":[146],"query":[149],"path":[150],"length":[151],"other":[154],"best":[155],"proposals":[157],"based":[158],"digraphs.":[163],"Thus,":[164],"de?nes":[166],"connected":[169],"connectivity":[172],"yet":[177],"known":[178],"lookup":[179],"DHiPeer.":[181],"Moreover,":[182],"node\u2019s":[187],"\"join":[188],"or":[189],"leave\"":[190],"operation":[191],"implies":[194],"constant":[196],"expected":[197],"reorganization":[198],"cost":[199],"magnitude":[202],"order":[203],"O(d)":[205],"control":[206],"messages.":[207]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}