Please use this identifier to cite or link to this item: https://bura.brunel.ac.uk/handle/2438/33596
Title: MRAI Optimization for BGP Convergence Time Reduction without Increasing the Number of Advertisement Messages
Authors: Alabdulkreem, EA
Al-Raweshidy, HS
Abbod, MF
Keywords: BGP;convergence time;MRAI;neuro fuzzy modelling
Issue Date: 10-Sep-2015
Publisher: Elsevier
Citation: Alabdulkreem, E.A., Al-Raweshidy, H.S. and Abbod, M.F. (2015) 'MRAI Optimization for BGP Convergence Time Reduction without Increasing the Number of Advertisement Messages', Procedia Computer Science, 62, pp. 419–426. doi: 10.1016/j.procs.2015.08.436.
Abstract: The primary cause for the slowness of the Border Gateway Protocol (BGP) convergence delay is the Minimum Route Advertisement Interval (MRAI). The MRAI is a timer with a default value of 30 seconds, which forces the BGP routers to wait for at least that amount of time before sending an advertisement for the same prefix. This process can delay important BGP advertisements. To date, there has been no specific value used by all the networks around the Internet. This paper aims to find the optimum value for the MRAI timer that maximally reduces the convergence time without increasing the number of advertisement messages. The optimal MRAI value founded by this paper reduced the convergence time by minimum 45%.
Description: Peer-review under responsibility of organizing committee of The 2015 International Conference on Soft Computing and Software Engineering (SCSE 2015).
URI: https://bura.brunel.ac.uk/handle/2438/33596
DOI: https://doi.org/10.1016/j.procs.2015.08.436
Other Identifiers: ORCiD: Hamed S. Al-Raweshidy https://orcid.org/0000-0002-3702-8192
ORCiD: Maysam F. Abbod https://orcid.org/0000-0002-8515-7933
Appears in Collections:Department of Electronic and Electrical Engineering Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2015. Published by Elsevier B.V. This is an open access article under a Creative Commons license (https://creativecommons.org/licenses/by-nc-nd/4.0/).808.31 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons