Dynamic Route Computation Considered Harmful

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, the authors argue for a separation of timescale between offline computation of multiple diverse paths and online spreading of load over these paths. The authors believe decoupling failure recovery from path computation leads to networks that are inherently more efficient, more scalable, and easier to manage.

Provided by: Princeton University Topic: Networking Date Added: Apr 2010 Format: PDF

Download Now

Find By Topic