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)
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
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
Random walks in peer-to-peer networks: algorithms and evaluation
Performance Evaluation - P2P computing systems
The forgiving tree: a self-healing distributed data structure
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
The forgiving graph: a distributed data structure for low stretch under adversarial attack
Proceedings of the 28th 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
Spanders: distributed spanning expanders
Proceedings of the 2010 ACM Symposium on Applied Computing
Partial information spreading with application to distributed maximum coverage
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Algorithms for self-healing networks
Algorithms for self-healing networks
Physical expander in virtual tree overlay
DISC'11 Proceedings of the 25th international conference on Distributed computing
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Dense subgraphs on dynamic networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Highly dynamic distributed computing with byzantine failures
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
We consider the problem of self-healing in reconfigurable networks (e.g. peer-to-peer and wireless mesh networks) that are under repeated attack by an omniscient adversary and propose a fully distributed algorithm, Xheal, that maintains good expansion and spectral properties of the network, also keeping the network connected. Moreover, Xheal does this while allowing only low stretch and degree increase per node. The algorithm heals global properties like expansion and stretch while only doing local changes and using only local information. We use a model similar to that used in recent work on self-healing. In our model, 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 by quick "repairs," which consist of adding or deleting edges in an efficient localized manner. These repairs preserve the edge expansion, spectral gap, and network stretch, after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, the expansion of the graph will be either 'better' than the expansion of the graph formed by considering only the adversarial insertions (not the adversarial deletions) or the expansion will be, at least, a constant. Also, the stretch i.e. the distance between any pair of nodes in the healed graph is no more than a O(log n) factor. 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 O(κ d) in the actual graph, for a small parameter κ. We also provide bounds on the second smallest eigenvalue of the Laplacian which captures key properties such as mixing time, conductance, congestion in routing etc. Our distributed data structure has low amortized latency and bandwidth requirements. Our work improves over the self-healing algorithms Forgiving tree [PODC 2008] and Forgiving graph [PODC 2009] in that we are able to give guarantees on degree and stretch, while at the same time preserving the expansion and spectral properties of the network.