Network Researchers Nail Down Theory of ‘Perfect Resilience’
Computer scientists have proved that exactly four simple network structures prevent "perfect resilience," the ability of a network to keep delivering data under any pattern of link failures short of a full cut-off.

The question was settled in a paper presented at the Symposium on Theory of Computing in June 2026 by Stefan Schmid of the Technical University of Berlin and Matthias Bentert. Routers must decide where to send packets using only local information, such as the status of links to their immediate neighbours, because global route calculations take too long. Without that global view, packets can get trapped in loops. The researchers used graph minor theory, in which simpler versions of a network are checked for obstructions, to show that networks lacking the four forbidden structures can always be given routing rules that reliably deliver packets.
The work builds on a 2012 paper by Michael Schapira, Brighten Godfrey and colleagues, which formally defined the problem and showed that perfect resilience is not always achievable. Schmid's 2020 work had identified two obstructions, and Bentert found a third and then a fourth. The solution also gives a fast algorithm for the routing rules, which follow a simple idea: take a right turn at every intersection.
Why it matters
The result settles a question open since 2012 and yields a fast method for designing resilient routing. Its authors warn that many real-world networks, particularly highly connected ones, may lack a solution, and they plan to study whether packets carrying a short history of visited nodes could extend the approach.