Achieving the minimal BPG convergence time

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