Improving BGP convergence through consistency assertions
- 1 January 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (0743166X) , 902-911 vol.2
- https://doi.org/10.1109/infcom.2002.1019337
Abstract
This paper presents a new mechanism for improving the convergence properties of path vector routing algorithms, such as BGP. Using a route's path information, we develop two consistency assertions for path vector routing algorithms that are used to compare similar routes and identify infeasible routes. To apply these assertions in BGP, mechanisms to signal failure/policy withdrawal, and traffic engineering are provided. Our approach was implemented and deployed in a BGP testbed and evaluated using simulation. By identifying and ignoring the infeasible routes, we achieved substantial reduction in both BGP convergence time and the total number of intermediate route changes.Keywords
This publication has 11 references indexed in Scilit:
- An experimental analysis of BGP convergence timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The impact of Internet policy and topology on delayed routing convergencePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Route Refresh Capability for BGP-4Published by RFC Editor ,2000
- Delayed Internet routing convergencePublished by Association for Computing Machinery (ACM) ,2000
- Capabilities Advertisement with BGP-4Published by RFC Editor ,2000
- Persistent route oscillations in inter-domain routingComputer Networks, 2000
- An architecture for residential Internet telephony serviceIEEE Internet Computing, 1999
- BGP Communities AttributePublished by RFC Editor ,1996
- Another adaptive distributed shortest path algorithmIEEE Transactions on Communications, 1991
- Transmission Control ProtocolPublished by RFC Editor ,1981