Report Open Access

OPTIC: An Efficient BGP Protection Technique For Optimal Intra-domain Convergence (Master's Thesis)

Jean-Romain Luttringer


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <controlfield tag="005">20210114002716.0</controlfield>
  <controlfield tag="001">4436109</controlfield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">2145131</subfield>
    <subfield code="z">md5:257075f2c7f1e8241bf5bd63be487c0d</subfield>
    <subfield code="u">https://zenodo.org/record/4436109/files/optic.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2019-08-28</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="o">oai:zenodo.org:4436109</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">University of Strasbourg</subfield>
    <subfield code="a">Jean-Romain Luttringer</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">OPTIC: An Efficient BGP Protection Technique For Optimal Intra-domain Convergence (Master's Thesis)</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">https://creativecommons.org/licenses/by/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;Interactions between the intra- and inter-domain routing protocols received little attention despite playing an important role in forwarding external traffic. More precisely, by default,&amp;nbsp;IGP distances are taken into account in the BGP decision process to select the closest exit gateway for the transit traffic, i.e., to enforce hot-potato&amp;nbsp;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. With our novel scheme, OPTIC (Optimal Protection Technique for Inter-intra domain Convergence), we propose an efficient way to reassemble the two protocols without losing the hot-potato property.&lt;/p&gt;

&lt;p&gt;OPTIC pre-computes sets of gateways, i.e., BGP next-hops, shared by groups of prefixes. Such sets are guaranteed to contain the post-convergence gateway after any single IGP event. 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&amp;#39;s structures allow it to consider a reduced number of entries: compared to the full set of single BGP prefixes, this number can be reduced by 99\% for stub networks. The update of OPTIC&amp;#39;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.&lt;/p&gt;

&lt;p&gt;&amp;nbsp;&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">doi</subfield>
    <subfield code="i">isVersionOf</subfield>
    <subfield code="a">10.5281/zenodo.4436108</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.5281/zenodo.4436109</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">report</subfield>
  </datafield>
</record>
30
29
views
downloads
All versions This version
Views 3030
Downloads 2929
Data volume 62.2 MB62.2 MB
Unique views 2626
Unique downloads 2424

Share

Cite as