1. Brunel University Research Archive
  2. College of Engineering, Design and Physical Sciences
  3. Department of Electronic and Electrical Engineering
  4. Department of Electronic and Electrical Engineering Research Papers
Please use this identifier to cite or link to this item: https://bura.brunel.ac.uk/handle/2438/33596
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAlabdulkreem, EA-
dc.contributor.authorAl-Raweshidy, HS-
dc.contributor.authorAbbod, MF-
dc.coverage.spatialBerkeley, CA, USA-
dc.date.accessioned2026-07-20T09:45:44Z-
dc.date.available2026-07-20T09:45:44Z-
dc.date.issued2015-09-10-
dc.identifierORCiD: Hamed S. Al-Raweshidy https://orcid.org/0000-0002-3702-8192-
dc.identifierORCiD: Maysam F. Abbod https://orcid.org/0000-0002-8515-7933-
dc.identifier.citationAlabdulkreem, 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.en-US
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/33596-
dc.descriptionPeer-review under responsibility of organizing committee of The 2015 International Conference on Soft Computing and Software Engineering (SCSE 2015).en-US
dc.description.abstractThe 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%.en-US
dc.format.extentpp. 419–426-
dc.format.mediumElectronic-
dc.languageEnglishen-US
dc.language.isoengen-US
dc.publisherElsevieren-US
dc.rightsCreative Commons Attribution-NonCommercial-NoDerivatives 4.0 International-
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/-
dc.source2015 International Conference on Soft Computing and Software Engineering (SCSE'15)-
dc.source2015 International Conference on Soft Computing and Software Engineering (SCSE'15)-
dc.subjectBGPen-US
dc.subjectconvergence timeen-US
dc.subjectMRAIen-US
dc.subjectneuro fuzzy modellingen-US
dc.titleMRAI Optimization for BGP Convergence Time Reduction without Increasing the Number of Advertisement Messagesen-US
dc.typeConference Paperen-US
dc.date.dateAccepted2015-01-10-
dc.identifier.doihttps://doi.org/10.1016/j.procs.2015.08.436-
dc.relation.isPartOfProcedia Computer Scienceen-US
pubs.finish-date2015-03-06-
pubs.finish-date2015-03-06-
pubs.publication-statusPublished-
pubs.start-date2015-03-05-
pubs.start-date2015-03-05-
pubs.volume62-
dc.identifier.eissn1877-0509-
dc.rights.licensehttps://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.en-
dcterms.dateAccepted2015-01-10-
dc.rights.holderElsevier on behalf of International Conference on Soft Computing and Software Engineering-
dc.contributor.orcidAl-Raweshidy, Hamed S. [0000-0002-3702-8192]-
dc.contributor.orcidAbbod. Maysam F. [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
Show simple item record


This item is licensed under a Creative Commons License Creative Commons