LOUP: who's afraid of the big bad loop?

We consider the intra-AS route dissemination problem from first principles, and illustrate that when known route dissemination techniques propagate even a single external routing change, they can cause transient anomalies. These anomalies are not fundamental; they are artifacts of the order in which existing proposals disseminate routes. We show that carefully ordering route updates avoids transient looping and black holes. Perhaps surprisingly, this ordering may be enforced in a completely distributed fashion, while retaining familiar correctness, scalability, and convergence properties.

[1]  Pierre Francois Loop-free convergence using oFIB , 2012 .

[2]  J. J. Garcia-Lunes-Aceves Loop-free routing using diffusing computations , 1993 .

[3]  Mark Handley,et al.  LOUP: The Principles and Practice of Intra-Domain Route Dissemination , 2013, NSDI.

[4]  Bruce M. Maggs,et al.  R-BGP: Staying Connected in a Connected World , 2007, NSDI.

[5]  Lixia Zhang,et al.  BGP route reflection revisited , 2012, IEEE Communications Magazine.

[6]  Nick Feamster,et al.  Design and implementation of a routing control platform , 2005, NSDI.

[7]  Jaeyoung Choi,et al.  Understanding BGP next-hop diversity , 2011, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[8]  Srikanth Kandula,et al.  Can you hear me now?!: it must be BGP , 2007, CCRV.

[9]  V. Jacobson,et al.  BST - BGP Scalable Transport , 2003 .

[10]  Jennifer Rexford,et al.  There's something about MRAI: Timing diversity can exponentially worsen BGP convergence , 2011, 2011 Proceedings IEEE INFOCOM.

[11]  Gordon T. Wilfong,et al.  Analysis of the MED oscillation problem in BGP , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[12]  J. J. Garcia-Luna-Aceves,et al.  Loop-free routing using diffusing computations , 1993, TNET.