An approach to seek policy disputes based on dispute cycle avoidance

Abstract

The Border Gateway Protocol (BGP) is the de facto inter-domain routing protocol used to exchange network reachability information between ASes in the global Internet. However, it was shown previously that the conflict of BGP routing policies can cause it to diverge. An approach is presented to seek the set of conflict routing policies based on dispute cycle avoidance. The stable paths problem, a static formalism that captures the semantics of inter-domain routing protocol, provides the theoretical foundation for this approach. And this approach draws on the simple path vector protocol to identify the dispute cycles that cause routing oscillation first, and then queries which routing policies lead to these cycles in a distributed manner. Finally, it determines conflict routing policies based on dispute cycle avoidance. In addition, a simulation instance is given in order to explain results of this method.