Neighbor-specific BGP: An algebraic exploration

There are several situations in which it would be advantageous to allow route preferences to be dependent on which neighbor is to receive the route. This idea could be realised in many possible ways and could interact differently with other elements of route choice, such as filtering: not all of these will have the property that a unique routing solution can always be found. We develop an algebraic model of route selection to aid in the analysis of neighbor-specific preferences in multipath routing. Using this model, we are able to identify a set of such routing schemes in which convergence is guaranteed.

[1]  Olivier Bonaventure,et al.  Customized BGP route selection Using BGP/MPLS VPNs , 2009 .

[2]  Ramesh Govindan,et al.  Time/Space Trade-offs in Route Server Implementation , 1995 .

[3]  Michel Minoux,et al.  Graphs, dioids and semirings : new models and algorithms , 2008 .

[4]  Gordon T. Wilfong,et al.  The stable paths problem and interdomain routing , 2002, TNET.

[5]  Yi Wang,et al.  Design for configurability: rethinking interdomain routing policies from the ground up , 2009, IEEE Journal on Selected Areas in Communications.

[6]  X.. Yang,et al.  NIRA: A New Inter-Domain Routing Architecture , 2007, IEEE/ACM Transactions on Networking.

[7]  Ben Dushnik,et al.  Partially Ordered Sets , 1941 .

[8]  Yi Wang,et al.  Neighbor-specific BGP: more flexible routing policies while improving global stability , 2009, SIGMETRICS '09.

[9]  Alexander J. T. Gurney,et al.  Lexicographic products in metarouting , 2007, 2007 IEEE International Conference on Network Protocols.

[10]  I. Anderson,et al.  Graphs and Networks , 1981, The Mathematical Gazette.

[11]  Brighten Godfrey,et al.  Pathlet routing , 2009, SIGCOMM '09.

[12]  Dan Pei,et al.  Wresting Control from BGP: Scalable Fine-Grained Route Control , 2007, USENIX Annual Technical Conference.

[13]  Xiaowei Yang,et al.  Source selectable path diversity via routing deflections , 2006, SIGCOMM.

[14]  Cengiz Alaettinoglu,et al.  Route Servers for Inter-Domain Routing , 1998, Comput. Networks.

[15]  W. Marsden.  I and J , 2012 .

[16]  Jennifer Rexford,et al.  Stable internet routing without global coordination , 2001, TNET.

[17]  Timothy G. Griffin,et al.  The stratified shortest-paths problem , 2010, COMSNETS 2010.

[18]  J. Weymark,et al.  A Quasiordering Is the Intersection of Orderings , 1998 .

[19]  Florent Parent,et al.  Routing Policy Specification Language next generation (RPSLng) , 2005, RFC.

[20]  Michel Minoux,et al.  Graphs and Algorithms , 1984 .

[21]  Jennifer Rexford,et al.  MIRO: multi-path interdomain routing , 2006, SIGCOMM 2006.

[22]  Olivier Bonaventure,et al.  BGP Add-Paths: The Scaling/Performance Tradeoffs , 2010, IEEE Journal on Selected Areas in Communications.