Dynamic route recomputation considered harmful

By: 
Matthew Caesar, Martin Casado, Teemu Koponen, Jennifer Rexford, and Scott Shenker
Appears in: 
CCR April 2010

This paper advocates a different approach to reduce routing convergence—side-stepping the problem by avoiding it in the first place! Rather than recomputing paths after temporary topology changes, we argue for a separation of timescale between offline computation of multiple diverse paths and online spreading of load over these paths. We believe decoupling failure recovery from path computation leads to networks that are inherently more efficient, more scalable, and easier to manage.