2006Unpublished venueRequires access

Eliminating BGP oscillations caused by policy conflicts

Hongiun Wang, Dadong Wang, Haiying Liang, Yuan Gao

Open publisher page 2 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Border Gateway Protocol, Default-free zone, Computer science, Routing (electronic design automation), Routing protocol, Computer network, Autonomous system (mathematics), The Internet

Related papers

Back to paper searchBrowse research topicsOriginal source
Eliminating BGP oscillations caused by policy conflicts — Research Paper | ScholarLens