Eliminating BGP oscillations caused by policy conflicts

The border gateway protocol (BGP) is currently the only inter-domain routing protocol employed on the Internet. It allows each autonomous system to independently define its own routing policies for selecting routes and propagating the routes to its neighbor autonomous systems. However, the collections of routing policies of autonomous systems can conflict in a manner that causes BGP to divergence. In this paper, we propose an approach to dynamically detect policy conflicts and eliminate permanent BGP route oscillations caused by the policy conflicts. The proposed algorithm detects policy conflicts using the relative preference value of selected route compared to the previous selected route. In order to prevent BGP oscillations, a data structure called the local route history is introduced to store routes involving oscillations. The proposed algorithm prevents BGP oscillations by suppressing routes reappear in the local route history.

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

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

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

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

[5]  Gordon T. Wilfong,et al.  A safe path vector protocol , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[6]  Ramesh Govindan,et al.  An architecture for stable, analyzable Internet routing , 1999, IEEE Netw..

[7]  John W. Stewart,et al.  BGP4 : inter-domain routing in the Internet , 1998 .

[8]  Lixin Gao,et al.  Stable Internet routing without global coordination , 2000, SIGMETRICS '00.