{"id":"https://openalex.org/W2136928097","doi":"https://doi.org/10.1145/1400751.1400779","title":"The forgiving tree","display_name":"The forgiving tree","publication_year":2008,"publication_date":"2008-08-18","ids":{"openalex":"https://openalex.org/W2136928097","doi":"https://doi.org/10.1145/1400751.1400779","mag":"2136928097"},"language":"en","primary_location":{"id":"doi:10.1145/1400751.1400779","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1400751.1400779","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-seventh 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/A5032099071","display_name":"Tom Hayes","orcid":null},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tom Hayes","raw_affiliation_strings":["Toyota Technological Institute, Chicago, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute, Chicago, IL, USA","institution_ids":["https://openalex.org/I160992636"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001987487","display_name":"Navin Rustagi","orcid":null},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Navin Rustagi","raw_affiliation_strings":["University of New Mexico, Albuquerque, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of New Mexico, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039997672","display_name":"Jared Saia","orcid":"https://orcid.org/0000-0002-3376-7334"},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jared Saia","raw_affiliation_strings":["University of New Mexico, Albuquerque, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of New Mexico, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I169521973"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004522545","display_name":"Amitabh Trehan","orcid":"https://orcid.org/0000-0002-2998-0933"},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Amitabh Trehan","raw_affiliation_strings":["University of New Mexico, Albuquerque, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of New Mexico, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I169521973"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5255,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.85651859,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"203","last_page":"212"},"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.9976000189781189,"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.9976000189781189,"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.9940000176429749,"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.9836999773979187,"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/adversary","display_name":"Adversary","score":0.8100849390029907},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6878706216812134},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6415995359420776},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5492609739303589},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5015888214111328},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.42992645502090454},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3267172873020172},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.2876376509666443},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24185290932655334},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17533251643180847},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11030611395835876}],"concepts":[{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.8100849390029907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6878706216812134},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6415995359420776},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5492609739303589},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5015888214111328},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.42992645502090454},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3267172873020172},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.2876376509666443},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24185290932655334},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17533251643180847},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11030611395835876},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1400751.1400779","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1400751.1400779","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-seventh ACM symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.217.974","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.974","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unm.edu/%7Esaia/papers/forgiving.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.561.9946","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.561.9946","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unm.edu/~amitabh/pubs/SelfHealing/ForgivingTreeNV19-525P.pdf","raw_type":"text"},{"id":"pmh:oai:durham-repository.worktribe.com:1140088","is_oa":false,"landing_page_url":"https://durham-repository.worktribe.com/output/1140088","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/cb940f5d-842f-48ac-918c-00728c031f37","is_oa":false,"landing_page_url":"https://pure.qub.ac.uk/en/publications/cb940f5d-842f-48ac-918c-00728c031f37","pdf_url":null,"source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hayes , T , Rustagi , N , Saia , J &amp; Trehan , A 2008 , The forgiving tree: a self-healing distributed data structure . in Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing. . PODC '08 , Association for Computing Machinery , New York, NY, USA , pp. 203-212 , PODC 2008: twenty-seventh ACM symposium on Principles of distributed computing , Toronto , Canada , 18/08/2008 . https://doi.org/10.1145/1400751.1400779","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1509021917","https://openalex.org/W1524702508","https://openalex.org/W1631038321","https://openalex.org/W1965996575","https://openalex.org/W1983275606","https://openalex.org/W2038065799","https://openalex.org/W2061896930","https://openalex.org/W2073512688","https://openalex.org/W2098862160","https://openalex.org/W2106034715","https://openalex.org/W2114051705","https://openalex.org/W2114450250","https://openalex.org/W2131856621","https://openalex.org/W2138244558","https://openalex.org/W2140252921","https://openalex.org/W2144553078","https://openalex.org/W2145344665","https://openalex.org/W2153290542","https://openalex.org/W2171699260","https://openalex.org/W2998995015","https://openalex.org/W4235733559"],"related_works":["https://openalex.org/W4388150944","https://openalex.org/W4242235492","https://openalex.org/W4237162029","https://openalex.org/W2367268135","https://openalex.org/W1480190076","https://openalex.org/W2385701518","https://openalex.org/W4237464767","https://openalex.org/W1658340114","https://openalex.org/W3122105331","https://openalex.org/W1985727224"],"abstract_inverted_index":{"We":[0,18],"consider":[1],"the":[2,21,33,40,42,48,51],"problem":[3],"of":[4,36,60],"self-healing":[5],"in":[6,39],"peer-to-peer":[7],"networks":[8],"that":[9,20],"are":[10],"under":[11],"repeated":[12],"attack":[13],"by":[14,54],"an":[15],"omniscient":[16],"adversary.":[17],"assume":[19],"following":[22],"process":[23],"continues":[24],"for":[25],"up":[26],"to":[27],"n":[28,31],"rounds":[29],"where":[30],"is":[32],"total":[34],"number":[35,59],"nodes":[37],"initially":[38],"network:":[41],"adversary":[43],"deletesan":[44],"arbitrary":[45],"node":[46],"from":[47],"network,":[49],"then":[50],"network":[52],"responds":[53],"quickly":[55],"adding":[56],"a":[57],"small":[58],"new":[61],"edges.":[62]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}
