The forgiving tree: a self-healing distributed data structure

  title={The forgiving tree: a self-healing distributed data structure},
  author={Thomas P. Hayes and Navin Rustagi and Jared Saia and Amitabh Trehan},
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up to n rounds where n is the total number of nodes initially in the network: the adversary deletesan arbitrary node from the network, then the network responds by quickly adding a small number of new edges. We present a distributed data structure that ensures two key properties. First, the diameter of the network is… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-4 of 4 references

Algorithms for self-healing networks

I-Ching C. Boman
M.S. Thesis, Computer Science, University of New Mexico., • 2006
View 4 Excerpts
Highly Influenced

Resilient overlay networks

View 3 Excerpts
Highly Influenced

Size-Estimation Framework with Applications to Transitive Closure and Reachability

J. Comput. Syst. Sci. • 1997
View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…