A Fast-Convergence Routing of the Hot-Potato
Jean-Romain Luttringer , Quentin Bramas , Cristel Pelsser and Pascal Mérindol
Abstract
Interactions between the intra- and inter-domain routing protocols received little attention despite playing an important role in forwarding transit traffic. More precisely, by default, IGP distances are taken into account by BGP to select the closest exit gateway for the transit traffic (hot-potato routing). Upon an IGP update, the new best gateway may change and should be updated through the (full) re-convergence of BGP, causing superfluous BGP processing and updates in many cases. We propose OPTIC (Optimal Protection Technique for Inter-intra domain Convergence), an efficient way to assemble both protocols without losing the hot-potato property. OPTIC pre-computes sets of gateways (BGP next-hops) shared by groups of prefixes. Such sets are guaranteed to contain the post-convergence gateway after any single IGP event for the grouped prefixes. The new optimal exits can be found through a single walk-through of each set, allowing the transit traffic to benefit from optimal BGP routes almost as soon as the IGP converges. Compared to vanilla BGP, OPTIC's structures allow it to consider a reduced number of entries: this number can be reduced by 99% for stub networks. The update of OPTIC's structures, which is not required as long as border routers remain at least bi-connected, scales linearly in time with its number of groups.
Publication Details
- Publication Type
- Conference Paper
- Publication Date
- April 2021
- Published In
- Infocom
- Digital Object Identifier (DOI)
- 10.1109/infocom42981.2021.9488880
- External Link
- http://icube-publis.unistra.fr/4-LBPM21
BibTeX Citation
@inproceedings{Luttringer2021a,
title = {A Fast-Convergence Routing of the Hot-Potato},
author = {Jean-Romain Luttringer and Quentin Bramas and Cristel Pelsser and Pascal Mérindol},
year = 2021,
month = apr,
booktitle = {Infocom},
doi = {10.1109/infocom42981.2021.9488880},
url = {http://icube-publis.unistra.fr/4-LBPM21},
abstract = {Interactions between the intra- and inter-domain routing protocols received little attention despite playing an important role in forwarding transit traffic. More precisely, by default, IGP distances are taken into account by BGP to select the closest exit gateway for the transit traffic (hot-potato routing). Upon an IGP update, the new best gateway may change and should be updated through the (full) re-convergence of BGP, causing superfluous BGP processing and updates in many cases. We propose OPTIC (Optimal Protection Technique for Inter-intra domain Convergence), an efficient way to assemble both protocols without losing the hot-potato property. OPTIC pre-computes sets of gateways (BGP next-hops) shared by groups of prefixes. Such sets are guaranteed to contain the post-convergence gateway after any single IGP event for the grouped prefixes. The new optimal exits can be found through a single walk-through of each set, allowing the transit traffic to benefit from optimal BGP routes almost as soon as the IGP converges. Compared to vanilla BGP, OPTIC's structures allow it to consider a reduced number of entries: this number can be reduced by 99\% for stub networks. The update of OPTIC's structures, which is not required as long as border routers remain at least bi-connected, scales linearly in time with its number of groups.},
groups = {International Conferences},
keywords = {BGP, IGP, Inter-domain, Hot-potato routing},
x-international-audience = {Yes},
x-language = {EN}
}
Related publications
L’Art d’Anticiper les Changements IGP pour Acheminer Optimalement la Patate en Transit
Jean-Romain Luttringer, Quentin Bramas, and Cristel Pelsser, et al.
CoRes, 2021
Using virtual coordinates in the establishment of inter-domain LSPs
Cristel Pelsser
Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2005, Toulouse, France, October 24-27, 2005, 2005
Using Virtual Coordinates in the Establishment of Inter-domain LSPs
Cristel Pelsser
CoNEXT 2005 (Student Workshop), 2005
Deploying Near-Optimal Delay-Constrained Paths with Segment Routing in Massive-Scale Networks
Jean-Romain Luttringer, Thomas Alfroy, and Pascal Mérindol, et al.
Computer Networks, 2022