Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Resolving Inter-Domain Policy Disputes

Cheng Tien Ee, Vijay Ramachandran, Byung-Gon Chun, Kaushik Lakshminarayanan and Scott Shenker

EECS Department
University of California, Berkeley
Technical Report No. UCB/EECS-2007-27
February 11, 2007

http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-27.pdf

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.


BibTeX citation:

@techreport{Ee:EECS-2007-27,
    Author = {Ee, Cheng Tien and Ramachandran, Vijay and Chun, Byung-Gon and Lakshminarayanan, Kaushik and Shenker, Scott},
    Title = {Resolving Inter-Domain Policy Disputes},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2007},
    Month = {Feb},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-27.html},
    Number = {UCB/EECS-2007-27},
    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.}
}

EndNote citation:

%0 Report
%A Ee, Cheng Tien
%A Ramachandran, Vijay
%A Chun, Byung-Gon
%A Lakshminarayanan, Kaushik
%A Shenker, Scott
%T Resolving Inter-Domain Policy Disputes
%I EECS Department, University of California, Berkeley
%D 2007
%8 February 11
%@ UCB/EECS-2007-27
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/2007/EECS-2007-27.html
%F Ee:EECS-2007-27