Resolving inter-domain policy disputes

Authors:
Cheng Tien Ee;Vijay Ramachandran;Byung-Gon Chun;Kaushik Lakshminarayanan;Scott Shenker
Affiliations:
UC Berkeley, Berkeley, CA;Colgate University, Hamilton, NY;UC Berkeley, Berkeley, CA;Indian Institute of Technology: Madras, Madras, India;UC Berkeley, Berkeley, CA
Venue:
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Year:
2007

Citing 10
Cited 5

Stable internet routing without global coordination

IEEE/ACM Transactions on Networking (TON)
On inferring autonomous system relationships in the internet

IEEE/ACM Transactions on Networking (TON)
The stable paths problem and interdomain routing

IEEE/ACM Transactions on Networking (TON)
Analysis of the MED Oscillation Problem in BGP

ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Design principles of policy languages for path vector protocols

Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Robustness of Class-Based Path-Vector Systems

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Implications of autonomy for the expressiveness of policy routing

Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
An algebraic theory of dynamic network routing

IEEE/ACM Transactions on Networking (TON)
Robust Path-Vector Routing Despite Inconsistent Route Preferences

ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
A stabilizing solution to the stable path problem

SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems

Safe interdomain routing under diverse commercial agreements

IEEE/ACM Transactions on Networking (TON)
Resolving inter-domain routing policy disputes at run-time with scalability consideration

Information Fusion
Toward a practical approach for BGP stability with root cause check

Journal of Parallel and Distributed Computing
Maintaining safety in interdomain routing with hierarchical path-categories

ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
An economic analysis of routing conflict and its resolution

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.