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.
|Original language||English (US)|
|Number of pages||6|
|Journal||Computer Communication Review|
|State||Published - Apr 1 2010|
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Internet architecture