An Approach to Seeking BGP Policy Confliction Based on Reconstructing Dispute Diagraph with Three-dimensional Matrix
Xicheng Lu · Shuxue de shijian yu renshi · 2006
The Border Gateway Protocol,BGP,is currently the only inter-domain routing protocol employed on the Internet.BGP is a path-vector protocol that allows each Autonomous System to override distance-based metrics with policy-based metrics when choosing best routes.Varadhan has shown that it is possible for a group of Autonomous Systems to independently define BGP policies that together lead to BGP protocol oscillations that never converge on a stable routing.Based on analyzing BGP with Stable Path Problem (SPP) model,Griffin proposed an efficient algorism that can find the policy confliction.But this algorithm faces several impediments.In this paper we present a new method which inherits Griffin′s merits and eliminates his impediments at the same time.With secure multi-party computation,our algorithm can work well and has significant practical value.