An approach to accelerate convergence for path vector protocol

BGP, a path vector protocol, is the de facto inter-domain routing protocol. However, slow convergence problem, the bigotry of path vector protocol, has demonstrated a significant impact on the performance of BGP. In this paper, we propose an enhancement to path vector protocol to alleviate the impact of slow convergence process. We compare the convergence time of the legacy path vector protocol and the improved one for complete AS graph, meanwhile the upper and lower bound of convergence time for any AS graph are given for the improved protocol. Simulation results reveal that the improved path vector protocol has a much better performance than the original one.