Analysis of BGP Convergence Using SHLPN Model

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.

[1]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.

[2]  Randy Zhang,et al.  BGP Design and Implementation , 2003 .

[3]  Yehuda Afek,et al.  Improved BGP convergence via ghost flushing , 2004, IEEE J. Sel. Areas Commun..

[4]  Gordon T. Wilfong,et al.  An analysis of BGP convergence properties , 1999, SIGCOMM '99.

[5]  Gordon T. Wilfong,et al.  The stable paths problem and interdomain routing , 2002, TNET.

[6]  Gordon T. Wilfong,et al.  Policy disputes in path-vector protocols , 1999, Proceedings. Seventh International Conference on Network Protocols.

[7]  Deborah Estrin,et al.  Persistent route oscillations in inter-domain routing , 2000, Comput. Networks.

[8]  Roger Wattenhofer,et al.  The impact of Internet policy and topology on delayed routing convergence , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[9]  Ramesh Govindan,et al.  BGP Route Flap Damping , 1998, RFC.

[10]  Daniel Behnen,et al.  Improving BGP Convergence Through Consistency Assertions , 2004 .

[11]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.