Feb 22, 2008 · Abstract: We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary.

We present a distributed data structure that ensures two key properties. First, the diameter of the network is never more than O(log Delta) times its original ...

Abstract. We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary.

We present a distributed data structure that ensures two key properties. First, the diameter of the network is never more than $O(\log \Delta)$ times its ...

Feb 22, 2008 · Abstract. We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary.

This work considers the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary, and presents a ...

Hayes, T., Rustagi, N., Saia, J., & Trehan, A. (2008). The forgiving tree: a self-healing distributed data structure.

Sounds similar to Freenet, which employs a "destination sampling" technique to establish and maintain a small world network topology (achieving retrieval ...

Bibliographic details on The Forgiving Tree: A Self-Healing Distributed Data Structure.