An approach to accelerate convergence for path vector protocol

@inproceedings{citeulike:2662942, abstract = {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.}, author = {Luo, Jiazeng and Xie, Junqing and Hao, Ruibing and Li, Xing }, booktitle = {Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE}, citeulike-article-id = {2662942}, doi = {http://dx.doi.org/10.1109/GLOCOM.2002.1189059}, journal = {Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE}, keywords = {bgp, convergence}, pages = {2390--2394 vol.3}, posted-at = {2008-04-13 07:18:55}, priority = {0}, title = {An approach to accelerate convergence for path vector protocol}, url = {http://dx.doi.org/10.1109/GLOCOM.2002.1189059}, volume = {3}, year = {2002} }

TY - CONF ID - citeulike:2662942 L3 - citeulike-article-id:2662942 TI - An approach to accelerate convergence for path vector protocol T2 - Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE JF - Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE VL - 3 SP - 2390 EP - 2394 vol.3 N2 - 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. KW - bgp KW - convergence AU - Luo, Jiazeng AU - Xie, Junqing AU - Hao, Ruibing AU - Li, Xing PY - 2002/// UR - http://dx.doi.org/10.1109/GLOCOM.2002.1189059 ER -