By Topic

BGP with an adaptive minimal route advertisement interval

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
N. Laskovic ; Simon Fraser Univ., Vancouver, BC, Canada ; L. Trajkovic

The duration of the minimal route advertisement interval (MRAI) and the implementation of MRAI timers have a significant influence on the convergence time of the border gateway protocol (BGP). Previous studies have reported existence of optimal MRAI values that minimize the BGP convergence time for various network topologies and traffic loads. In this paper, we propose the adaptive MRAI algorithm for adaptive adjustment of MRAI values. We also introduce reusable MRAI timers that independently limit advertisements of individual destinations. The modified BGP is named BGP with adaptive MRAI (BGP-AM). BGP processing delay used in the evaluation of BGP-AM is based on reported measurements, ns-2 simulation results demonstrate that BGP-AM leads to a shorter convergence time while maintaining a number of update messages comparable to the current BGP implementation. BGP-AM convergence time depends linearly on the BGP processing delay

Published in:

2006 IEEE International Performance Computing and Communications Conference

Date of Conference:

10-12 April 2006