{"id":"https://openalex.org/W2129833640","doi":"https://doi.org/10.1109/icpp.2003.1240580","title":"HIERAS: a DHT based hierarchical P2P routing algorithm","display_name":"HIERAS: a DHT based hierarchical P2P routing algorithm","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W2129833640","doi":"https://doi.org/10.1109/icpp.2003.1240580","mag":"2129833640"},"language":"en","primary_location":{"id":"doi:10.1109/icpp.2003.1240580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2003.1240580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 International Conference on Parallel Processing, 2003. Proceedings.","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/A5100642950","display_name":"Zhiyong Xu","orcid":"https://orcid.org/0000-0001-9544-1500"},"institutions":[{"id":"https://openalex.org/I63135867","display_name":"University of Cincinnati","ror":"https://ror.org/01e3m7079","country_code":"US","type":"education","lineage":["https://openalex.org/I63135867"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Zhiyong Xu","raw_affiliation_strings":["Department of Electrical & Computer Engineering and Computer Science, University of Cincinnati, Cincinnati, OH, USA","Dept. of Electr. & Comput. Eng. & Comput. Sci., Cincinnati Univ., OH#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering and Computer Science, University of Cincinnati, Cincinnati, OH, USA","institution_ids":["https://openalex.org/I63135867"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng. & Comput. Sci., Cincinnati Univ., OH#TAB#","institution_ids":["https://openalex.org/I63135867"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060935714","display_name":"Rui Min","orcid":"https://orcid.org/0000-0003-1248-7904"},"institutions":[{"id":"https://openalex.org/I63135867","display_name":"University of Cincinnati","ror":"https://ror.org/01e3m7079","country_code":"US","type":"education","lineage":["https://openalex.org/I63135867"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rui Min","raw_affiliation_strings":["Department of Electrical & Computer Engineering and Computer Science, University of Cincinnati, Cincinnati, OH, USA","Dept. of Electr. & Comput. Eng. & Comput. Sci., Cincinnati Univ., OH#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering and Computer Science, University of Cincinnati, Cincinnati, OH, USA","institution_ids":["https://openalex.org/I63135867"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng. & Comput. Sci., Cincinnati Univ., OH#TAB#","institution_ids":["https://openalex.org/I63135867"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034686090","display_name":"Yiming Hu","orcid":"https://orcid.org/0000-0002-0988-1030"},"institutions":[{"id":"https://openalex.org/I63135867","display_name":"University of Cincinnati","ror":"https://ror.org/01e3m7079","country_code":"US","type":"education","lineage":["https://openalex.org/I63135867"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yiming Hu","raw_affiliation_strings":["Department of Electrical & Computer Engineering and Computer Science, University of Cincinnati, Cincinnati, OH, USA","Dept. of Electr. & Comput. Eng. & Comput. Sci., Cincinnati Univ., OH#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering and Computer Science, University of Cincinnati, Cincinnati, OH, USA","institution_ids":["https://openalex.org/I63135867"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng. & Comput. Sci., Cincinnati Univ., OH#TAB#","institution_ids":["https://openalex.org/I63135867"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100642950"],"corresponding_institution_ids":["https://openalex.org/I63135867"],"apc_list":null,"apc_paid":null,"fwci":4.7275,"has_fulltext":false,"cited_by_count":115,"citation_normalized_percentile":{"value":0.95451351,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"187","last_page":"194"},"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.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/T10741","display_name":"Video Coding and Compression Technologies","score":0.965499997138977,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.7727266550064087},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6673519611358643},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.6145844459533691},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6104267239570618},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6006960272789001},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5695449709892273},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.5536928772926331},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5446204543113708},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5391059517860413},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.5384089946746826},{"id":"https://openalex.org/keywords/hierarchical-routing","display_name":"Hierarchical routing","score":0.5136234164237976},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.4717365503311157},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4115232825279236},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4109010100364685},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3334782123565674},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.31741636991500854},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.06219926476478577}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7727266550064087},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6673519611358643},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.6145844459533691},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6104267239570618},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6006960272789001},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5695449709892273},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.5536928772926331},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5446204543113708},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5391059517860413},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.5384089946746826},{"id":"https://openalex.org/C177818476","wikidata":"https://www.wikidata.org/wiki/Q12878103","display_name":"Hierarchical routing","level":5,"score":0.5136234164237976},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.4717365503311157},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4115232825279236},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4109010100364685},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3334782123565674},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.31741636991500854},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.06219926476478577},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icpp.2003.1240580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.2003.1240580","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 International Conference on Parallel Processing, 2003. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W3976408","https://openalex.org/W1527961683","https://openalex.org/W1580004440","https://openalex.org/W1642027348","https://openalex.org/W1650675509","https://openalex.org/W1948092788","https://openalex.org/W1957582590","https://openalex.org/W2004318506","https://openalex.org/W2049994230","https://openalex.org/W2104210894","https://openalex.org/W2123820820","https://openalex.org/W2146109212","https://openalex.org/W2148647281","https://openalex.org/W2150676586","https://openalex.org/W2152319665","https://openalex.org/W2155659292","https://openalex.org/W2158049821","https://openalex.org/W2163059190","https://openalex.org/W2163598690","https://openalex.org/W2167898414","https://openalex.org/W2174507869","https://openalex.org/W3162105941","https://openalex.org/W4236944670","https://openalex.org/W4254857363","https://openalex.org/W6631712812","https://openalex.org/W6634670644","https://openalex.org/W6637042374","https://openalex.org/W6637202848","https://openalex.org/W6684355970","https://openalex.org/W6684507281"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2155400411","https://openalex.org/W4253436398","https://openalex.org/W1538003338","https://openalex.org/W2068473861","https://openalex.org/W2364686261","https://openalex.org/W1984835167","https://openalex.org/W2351097701","https://openalex.org/W2556128816","https://openalex.org/W2162880363"],"abstract_inverted_index":{"Routing":[0,135],"algorithm":[1,55,186],"has":[2],"great":[3],"influence":[4],"on":[5],"system":[6,25,46,72,191],"overall":[7,104],"performance":[8,74,193],"in":[9,112,124,140,160,170],"peer-to-peer":[10],"(P2P)":[11],"applications.":[12],"In":[13,81],"current":[14,67],"DHT":[15,68],"based":[16],"routing":[17,19,29,47,54,73,156,175,185,192],"algorithms,":[18],"tasks":[20,136],"are":[21,137,165],"distributed":[22],"across":[23],"all":[24],"peers.":[26],"However,":[27],"a":[28,51,100,114,152],"hop":[30],"could":[31],"happen":[32],"between":[33,121],"two":[34,122],"widely":[35],"separated":[36],"peers":[37,123],"with":[38],"high":[39],"network":[40],"link":[41,119],"latency":[42,120],"which":[43],"greatly":[44],"increases":[45],"overheads.":[48],"We":[49,108],"propose":[50],"new":[52],"P2P":[53,88,94,97,105,110,163,190],"-":[56],"HIERAS":[57,184],"to":[58,148],"relieve":[59],"this":[60],"problem,":[61],"it":[62],"keeps":[63],"scalability":[64],"property":[65],"of":[66,78,102,155],"algorithms":[69],"and":[70],"improves":[71],"by":[75,168],"the":[76,91,103,117,161],"introduction":[77],"hierarchical":[79],"structure.":[80],"HIERAS,":[82],"we":[83],"create":[84,109],"several":[85],"lower":[86,125,141,171],"level":[87,93,126,133,142,150,172],"rings":[89,111,127,143],"besides":[90],"highest":[92],"ring.":[95],"A":[96],"ring":[98,164],"is":[99,128],"subset":[101],"overlay":[106],"network.":[107],"such":[113],"strategy":[115],"that":[116],"average":[118],"much":[129],"smaller":[130],"than":[131],"higher":[132,149],"rings.":[134],"first":[138],"executed":[139,159],"before":[144],"they":[145],"go":[146],"up":[147],"rings,":[151,173],"large":[153],"portion":[154],"hops":[157,169],"previously":[158],"global":[162],"now":[166],"replaced":[167],"thus":[174],"overheads":[176],"can":[177,187],"be":[178],"reduced.":[179],"The":[180],"simulation":[181],"results":[182],"show":[183],"significantly":[188],"improve":[189]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":10}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}