Algorithms for Self-Healing Networks
Amitabh Trehan

TL;DR
This paper introduces distributed algorithms enabling reconfigurable networks to self-heal after failures, maintaining key properties and resilience against adversarial attacks, addressing the complexity of modern dynamic networks.
Contribution
It presents several fast, provably effective algorithms for self-healing in reconfigurable dynamic networks, each with unique guarantees and limitations.
Findings
Algorithms ensure network resilience after failures
Protocols maintain key network invariants
Approaches are provably efficient and adaptable
Abstract
Many modern networks are \emph{reconfigurable}, in the sense that the topology of the network can be changed by the nodes in the network. For example, peer-to-peer, wireless and ad-hoc networks are reconfigurable. More generally, many social networks, such as a company's organizational chart; infrastructure networks, such as an airline's transportation network; and biological networks, such as the human brain, are also reconfigurable. Modern reconfigurable networks have a complexity unprecedented in the history of engineering, resembling more a dynamic and evolving living animal rather than a structure of steel designed from a blueprint. Unfortunately, our mathematical and algorithmic tools have not yet developed enough to handle this complexity and fully exploit the flexibility of these networks. We believe that it is no longer possible to build networks that are scalable and never…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Modular Robots and Swarm Intelligence · Distributed systems and fault tolerance
