Adapting to asynchronous dynamic networks (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
IEEE/ACM Transactions on Networking (TON)
Restoration strategies and spare capacity requirements in self-healing ATM networks
IEEE/ACM Transactions on Networking (TON)
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Comparative Study on Restoration Schemes of Survivable ATM Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
HICSS '04 Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The forgiving tree: a self-healing distributed data structure
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Brief announcement: self-healing algorithms for reconfigurable networks
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Know thy neighbor’s neighbor: better routing for skip-graphs and small worlds
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Xheal: localized self-healing using expanders
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Distributed overlay maintenance with application to data consistency
Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Future Generation Computer Systems
Sublinear-Time maintenance of breadth-first spanning tree in partially dynamic networks
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been ℓ in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most ℓ log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from [8] in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it does not require an initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.