基于竞争弧的BGP路由策略冲突检测  

Detecting BGP Policy Conflicts Through Dispute Arc

作　　者：王洪君[1] 王瑞军[1] 王大东[2] 高远[1] 

机构地区：[1]东北大学信息科学与工程学院,辽宁沈阳110004 [2]吉林师范大学,吉林四平136000

出　　处：《东北大学学报（自然科学版）》2004年第10期942-945,共4页Journal of Northeastern University(Natural Science)

基　　金：国家自然科学基金资助项目(60073059和60273078).

摘　　要：给出一种BGP策略冲突动态检测方法,该方法基于有向竞争图理论,通过构建竞争弧来发现路由策略冲突的AS及相关路由·用路由相对优先级来描述到同一目的两条路由的优选关系·根据竞争弧形成条件,相邻两个AS到达同一目的的两条路由相对优先级不同,这两个AS的路由策略存在冲突·对BGP协议进行了修改,增加一个新的属性,该属性值为所选最佳路由与先前最佳路由的相对优先级·最后通过SSFNET仿真实验证实了该方法的有效性·A method to dynamically find BGP policy conflicts is proposed. Based on the theory of dispute digraph, this method will find the autonomous systems (ASs) between which the routing policies conflict with each other and corresponding routes by constructing a dispute arc. The relative preference of route is used to describe the preference relationship between two different routes to the network of the same destination. According to the formation conditions of the dispute arc, the difference of relative preference between two adjacent AS routes to the same destination indicates that the routing policies of the two ASs are conflicting with each other. In order to find route policy conflicts, a new attribute is defined in BGP to carry repeatedly the relative preference of the newly selected best route to the previous one. The simulations through SSFNET show that the method is effective and feasible.

关 键 词：BGP协议 自治系统 路由策略 有向竞争图 路由 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]