基于有向竞争图的BGP收敛时间

Convergence Time of BGP Based on Dispute Digraph

基于有向竞争图理论研究BGP协议收敛时间问题·有向竞争图反映了自治系统间路由策略的关系,路由策略一致或路由策略冲突·研究表明BGP收敛时间与有向竞争图的路径长度相关,给出了基于有向竞争图的BGP协议收敛时间范围·BGP的收敛时间大于等于竞争图内极长路径所需时间最小值,小于等于竞争图内所有路径所需时间最大值·用SSFNET仿真实验证明了所给时间范围的正确性·

BGP convergence time is studied on the basis of dispute digraph, which reveals the relationships between routing policies of different autonomous systems. Dispute arc and transmission arc of the dispute digraph indicate respectively the policy conflict and policy consistency. The results show that the routing convergence time correlates with the length of the longest path in dispute digraph for a network. The BGP convergence time based on dispute digraph is given. The convergence time is greater than or equals to the minimum. Time required for the local longest paths, which only consists of the transmission arcs followed with or without a dispute arc in the dispute digraph corresponding to the network, whereas it is less than or equals to the maximum time required for all the paths of the dispute digraph. The convergence time given is proved sound and exemplified through an SSFNET simulation.