DocumentCode :
380670
Title :
Improving BGP convergence through consistency assertions
Author :
Pei, Dan ; Zhao, Xiaoliang ; Wang, Lan ; Massey, Daniel ; Mankin, Allison ; Su, S.F. ; Zhang, Lixia
Author_Institution :
California Univ., Los Angeles, CA, USA
Volume :
2
fYear :
2002
fDate :
2002
Firstpage :
902
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 :
convergence; graph theory; routing protocols; telecommunication traffic; BGP convergence; consistency assertions; failure/policy withdrawal; infeasible routes; intermediate route changes; path vector routing algorithms; similar routes; simulation; traffic engineering; Contracts; Control systems; Convergence; Delay; IP networks; Internet; Mechanical factors; Routing protocols; Testing; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM 2002. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
ISSN :
0743-166X
Print_ISBN :
0-7803-7476-2
Type :
conf
DOI :
10.1109/INFCOM.2002.1019337
Filename :
1019337
Link To Document :
بازگشت