Analysis of BGP Convergence Using SHLPN Model

Abstract

BGP can be looked as a distributed algorithm to solve the stable paths problem. Routing policies conflict among ASes may cause routing divergence in Internet. Several research efforts analyze BGP convergence by describing BGP routing mechanism statically and designating BGP events in artificial sequence. In this paper, we present a stochastic high-level petri net model of simple path vector protocol, which conforms to the event-driven property of BGP. Basing on the model, the essence of routing policies conflict is analyzed and an algorithm is proposed to locate the conflict.