Brief announcement: self-healing algorithms for reconfigurable networks

Authors:
Iching Boman;Jared Saia;Chaouki T. Abdallah;Edl Schamiloglu
Affiliations:
University of New Mexico, Albuquerque, NM;University of New Mexico, Albuquerque, NM;University of New Mexico, Albuquerque, NM;University of New Mexico, Albuquerque, NM
Venue:
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Year:
2006

Citing 0
Cited 4

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
Xheal: localized self-healing using expanders

Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A systematic method for network topology reconfiguration with limited link additions

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm to self-heal reconfigurable networks. This algorithm reconfigures the network during an attack to protect two critical invariants. First, it insures that the network remains connected. Second, it insures that no node increases its degree by more than O(log n). We prove that our algorithm can successfully maintain these invariants even for large networks under massive attack by a computationally unbounded adversary.