Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 29994
A Methodology for Reducing the BGP Convergence Time

Authors: Eatedal A. Alabdulkreem, Hamed S. Al-Raweshidy, Maysam F. Abbod

Abstract:

Border Gateway Protocol (BGP) is the standard routing protocol between various autonomous systems (AS) in the internet. In the event of failure, a considerable delay in the BGP convergence has been shown by empirical measurements. During the convergence time the BGP will repeatedly advertise new routes to some destination and withdraw old ones until it reach a stable state. It has been found that the KEEPALIVE message timer and the HOLD time are tow parameters affecting the convergence speed. This paper aims to find the optimum value for the KEEPALIVE timer and the HOLD time that maximally reduces the convergence time without increasing the traffic. The KEEPALIVE message timer optimal value founded by this paper is 30 second instead of 60 seconds, and the optimal value for the HOLD time is 90 seconds instead of 180 seconds.

Keywords: BGP, Convergence Time, HOLD time, Keep alive.

Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1328916

Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF

References:


[1] G. Huaming, S. Wei, Z. Hongke and K. Sy-yen, "On the convergence condition and convergence time of BGP". Elsevier, vol. 34, no. 2, pp. 192-199, 2011.
[2] Y. Rekhter, and T. Li, "A Bordeer Gateway Proto col 4 (BGP-4) RRFC 1771”, 1995.
[3] C. Labovitz, A. Ahuja, A. Bose,, and F. Jahaniann, "Delayed Interrnet Routing Converrgence”, IEEE/AACM Transactioons on Networkiing, vol. 9, no. 3, pp. 293-306, 2001.
[4] B. Wang, "The Research of BGPP Convergence TTime”, IEEE ICNNP, pp. 53-61, 2011.
[5] M. Yannuzzi, aand X. Masip-Brruin, "Open Issuues in Interdommain Routing: A Surveey”. IEEE Netwoork, vol. 19, no. 66, pp. 49-56, 20055.
[6] A. Shaoo, K. Kaant, and P. Mohaapatra, "Bgp convvergence delay after simultaneous rouuter failures: charracterization and solutions”. Elsevvier, vol. 32, no. 10, ppp. 1207-1218, 20009.
[7] K. Calvert, L. GGeorgia, M. Doarr, and B. Zegura, "Modeling Interrnet topology. Commmunications Maggazine”, IEEE, vvol. 35, no. 6, pp. 160-163, 1997.
[8] Brite: Univerrsal topologyy generator. Available at: www.cs.bu.edu/bbrite/, 2001.
[9] Route views projject pages, availaable at: www.routeviews.org, 19944.
[10] T. Ashuton, M. Marina, "Knowlledge-based paraameter identificattion of TSK fuzzy mmodels”, Applied Soft Computing, ScienceDirect, vvol.10, no.2, pp. 481 -489, 2010.
[11] C. Hongyan, L.. Jian, L. Xiang, and C. Yunlognng, "Particle Swaarm Optimization forr Multi-constrainned Routing in Telecommunicattion Networks”. Commputer Network and Informationn Security, vol. 4, pp.10-17, 2011.