DocumentCode
2407164
Title
Achieving the minimal BPG convergence time
Author
Schwabe, Thomas
Author_Institution
Inst. of Commun. Networks, Technische Univ. Munchen, Munich
fYear
0
fDate
0-0 0
Firstpage
110
Lastpage
116
Abstract
Since the publication of the measurements of the BGP convergence time done by Labovitz (2001) the improvement of this long lasting process is addressed very often. Just the new EPIC approach avoids the path exploration of BGP and with that the slow convergence time. This paper analyses the BGP convergence process and estimates the lower bound of the BGP convergence time based on an analytical model. For reaching the observed lower bound EPIC should be used. Additionally the BGP timer-MRAI and MASOI-have to switch off. That this could be done is validated by simulations
Keywords
Internet; convergence; routing protocols; BGP convergence; EPIC approach; MASOI; MRAI; border gateway protocol; enhanced path vector protocol; Analytical models; Communication networks; Communication switching; Convergence; IP networks; Internet; Routing protocols; Switches; Time measurement; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Next Generation Internet Design and Engineering, 2006. NGI '06. 2006 2nd Conference on
Conference_Location
Valencia
Print_ISBN
0-7803-9455-0
Electronic_ISBN
0-7803-9456-9
Type
conf
DOI
10.1109/NGI.2006.1678230
Filename
1678230
Link To Document