An Approach to Seeking Policy Disputes Based on Dispute Cycle Avoidance

An approach to seeking the collection of conflicting routing policies based on dispute cycle avoidance is shown The stable paths problem, a static formalism that captures the semantics of inter domain routing protocol, provides the theoretical foundation for this approach The approach makes use of the safe path vector protocol to identify the dispute cycles that cause routing oscillation, and then queries which routing policies lead to these cycles with distributed manner Finally, it confirms the conflicting routing policies based on dispute cycle avoidance In addition, a simulation instance is given in order to explain the results of this method