Resolving inter-domain policy disputes

The Border Gateway Protocol (BGP) allows each autonomous system (AS) to select routes to destinations based on semantically rich and locally determined policies. This autonomously exercised policy freedom can cause instability, where unresolvable policy-based disputes in the network result in interdomain route oscillations. Several recent works have established that such instabilities can only be eliminated by enforcing a globally accepted preference ordering on routes (such as shortest path). To resolve this conflict between policy autonomy and system stability, we propose a distributed mechanism that enforces a preference ordering only when disputes resulting in oscillations exist. This preserves policy freedom when possible, and imposes stability when required.

[1]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[2]  Deborah Estrin,et al.  Persistent route oscillations in inter-domain routing , 2000, Comput. Networks.

[3]  Gordon T. Wilfong,et al.  A safe path vector protocol , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  Lixin Gao,et al.  On inferring autonomous system relationships in the Internet , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[5]  Deborah Estrin,et al.  The impact of routing policy on Internet paths , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[7]  Jennifer Rexford,et al.  Inherently safe backup routing with BGP , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

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

[10]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Mohamed G. Gouda,et al.  A Stabilizing Solution to the Stable Path Problem , 2003, Self-Stabilizing Systems.

[12]  Vijay Ramachandran,et al.  Design principles of policy languages for path vector protocols , 2003, SIGCOMM '03.

[13]  Vijay Ramachandran,et al.  Robustness of class-based path-vector systems , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[14]  João L. Sobrinho,et al.  An algebraic theory of dynamic network routing , 2005, IEEE/ACM Transactions on Networking.

[15]  Susan Hares,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[16]  Vijay Ramachandran,et al.  Robust Path-Vector Routing Despite Inconsistent Route Preferences , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[17]  Nick Feamster,et al.  Implications of autonomy for the expressiveness of policy routing , 2007, TNET.