IEICE TRANSACTIONS on Communications
The Optimal Rate-Limiting Timer of BGP for Routing Convergence
Summary :
BGP might experience a lengthy path exploration process to reach the convergence after the routing changes. found that the BGP rate-limiting timer--MinRouteAdvertisementInterval (MRAI) has an optimal value Mo that achieves the best trade-off between the stability and the convergence speed. In this paper, with the aid of a timed BGP model, we investigate the effects of MRAI and its optimal value Mo for the BGP convergence process. We find that an adequately long MRAI timer can batch-remove candidate paths and ensure the routing stability in the convergence process. There exists a minimal MRAI Ms that achieves the effect, which is also the upper bound of Mo and provides an approximation of Mo. We calculate the approximations of Ms for different settings and estimate the optimal MRAI for the Internet. According to the results, the optimal MRAI for the Internet might be 5-10 times less than the current default value used in the Internet. The simulations taken with SSFNet and the experiments conducted over the Planet-Lab demonstrate the correctness of our analysis.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E88-B No.4 pp.1338-1346
- Publication Date
- 2005/04/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietcom/e88-b.4.1338
- Type of Manuscript
- Special Section PAPER (Special Section on Internet Technology V)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jian QIU, Ruibing HAO, Xing LI, "The Optimal Rate-Limiting Timer of BGP for Routing Convergence" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 4, pp. 1338-1346, April 2005, doi: 10.1093/ietcom/e88-b.4.1338.
Abstract: BGP might experience a lengthy path exploration process to reach the convergence after the routing changes. found that the BGP rate-limiting timer--MinRouteAdvertisementInterval (MRAI) has an optimal value Mo that achieves the best trade-off between the stability and the convergence speed. In this paper, with the aid of a timed BGP model, we investigate the effects of MRAI and its optimal value Mo for the BGP convergence process. We find that an adequately long MRAI timer can batch-remove candidate paths and ensure the routing stability in the convergence process. There exists a minimal MRAI Ms that achieves the effect, which is also the upper bound of Mo and provides an approximation of Mo. We calculate the approximations of Ms for different settings and estimate the optimal MRAI for the Internet. According to the results, the optimal MRAI for the Internet might be 5-10 times less than the current default value used in the Internet. The simulations taken with SSFNet and the experiments conducted over the Planet-Lab demonstrate the correctness of our analysis.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.4.1338/_p
Copy
@ARTICLE{e88-b_4_1338,
author={Jian QIU, Ruibing HAO, Xing LI, },
journal={IEICE TRANSACTIONS on Communications},
title={The Optimal Rate-Limiting Timer of BGP for Routing Convergence},
year={2005},
volume={E88-B},
number={4},
pages={1338-1346},
abstract={BGP might experience a lengthy path exploration process to reach the convergence after the routing changes. found that the BGP rate-limiting timer--MinRouteAdvertisementInterval (MRAI) has an optimal value Mo that achieves the best trade-off between the stability and the convergence speed. In this paper, with the aid of a timed BGP model, we investigate the effects of MRAI and its optimal value Mo for the BGP convergence process. We find that an adequately long MRAI timer can batch-remove candidate paths and ensure the routing stability in the convergence process. There exists a minimal MRAI Ms that achieves the effect, which is also the upper bound of Mo and provides an approximation of Mo. We calculate the approximations of Ms for different settings and estimate the optimal MRAI for the Internet. According to the results, the optimal MRAI for the Internet might be 5-10 times less than the current default value used in the Internet. The simulations taken with SSFNet and the experiments conducted over the Planet-Lab demonstrate the correctness of our analysis.},
keywords={},
doi={10.1093/ietcom/e88-b.4.1338},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - The Optimal Rate-Limiting Timer of BGP for Routing Convergence
T2 - IEICE TRANSACTIONS on Communications
SP - 1338
EP - 1346
AU - Jian QIU
AU - Ruibing HAO
AU - Xing LI
PY - 2005
DO - 10.1093/ietcom/e88-b.4.1338
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2005
AB - BGP might experience a lengthy path exploration process to reach the convergence after the routing changes. found that the BGP rate-limiting timer--MinRouteAdvertisementInterval (MRAI) has an optimal value Mo that achieves the best trade-off between the stability and the convergence speed. In this paper, with the aid of a timed BGP model, we investigate the effects of MRAI and its optimal value Mo for the BGP convergence process. We find that an adequately long MRAI timer can batch-remove candidate paths and ensure the routing stability in the convergence process. There exists a minimal MRAI Ms that achieves the effect, which is also the upper bound of Mo and provides an approximation of Mo. We calculate the approximations of Ms for different settings and estimate the optimal MRAI for the Internet. According to the results, the optimal MRAI for the Internet might be 5-10 times less than the current default value used in the Internet. The simulations taken with SSFNet and the experiments conducted over the Planet-Lab demonstrate the correctness of our analysis.
ER -
English
