Dynamic route recomputation considered harmful

  • Authors:
  • Matthew Caesar;Martin Casado;Teemu Koponen;Jennifer Rexford;Scott Shenker

  • Affiliations:
  • University of Illinois at Urbana-Champaign, Urbana, IL, USA;Nicira Networks Inc., Palo Alto, CO, USA;Nicira Networks Inc., Palo Alto, CA, USA;Princeton University, Princeton, NJ, USA;University of California at Berkeley, Berkeley, CA, USA

  • Venue:
  • ACM SIGCOMM Computer Communication Review
  • Year:
  • 2010

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.