<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01987354</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-18T12:10:21+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A stack-vector routing protocol for automatic tunneling</title>
            <author role="aut">
              <persName>
                <forename type="first">Mohamed Lamine</forename>
                <surname>Lamali</surname>
              </persName>
              <email type="md5">261fe46d6cf43ee5353fed66b5f736ab</email>
              <email type="domain">u-bordeaux.fr</email>
              <idno type="idhal" notation="string">mohamed-lamine-lamali</idno>
              <idno type="idhal" notation="numeric">176101</idno>
              <idno type="halauthorid" notation="string">38998-176101</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9307-7482</idno>
              <idno type="IDREF">https://www.idref.fr/185163971</idno>
              <affiliation ref="#struct-3102"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Simon</forename>
                <surname>Lassourreuille</surname>
              </persName>
              <idno type="halauthorid">1502795-0</idno>
              <affiliation ref="#struct-3102"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Stephan</forename>
                <surname>Kunne</surname>
              </persName>
              <idno type="halauthorid">1494608-0</idno>
              <affiliation ref="#struct-399697"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Johanne</forename>
                <surname>Cohen</surname>
              </persName>
              <email type="md5">b26c57c772e91c561ab577a717af43eb</email>
              <email type="domain">lri.fr</email>
              <idno type="idhal" notation="string">johanne-cohen</idno>
              <idno type="idhal" notation="numeric">7467</idno>
              <idno type="halauthorid" notation="string">23390-7467</idno>
              <idno type="IDREF">https://www.idref.fr/145022269</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-9548-5260</idno>
              <idno type="ISNI">http://isni.org/isni/0000000357703658</idno>
              <idno type="VIAF">https://viaf.org/viaf/200825481</idno>
              <affiliation ref="#struct-2544"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Mohamed Lamine</forename>
                <surname>Lamali</surname>
              </persName>
              <email type="md5">261fe46d6cf43ee5353fed66b5f736ab</email>
              <email type="domain">u-bordeaux.fr</email>
            </editor>
            <funder ref="#projanr-48440"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-01-23 12:49:36</date>
              <date type="whenModified">2025-05-26 14:36:02</date>
              <date type="whenReleased">2019-01-24 11:08:44</date>
              <date type="whenProduced">2019-04-29</date>
              <date type="whenEndEmbargoed">2019-01-23</date>
              <ref type="file" target="https://hal.science/hal-01987354v1/document">
                <date notBefore="2019-01-23"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01987354v1/file/infocom_distributed%20%281%29.pdf" id="file-1987354-2010064">
                <date notBefore="2019-01-23"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1901.08326"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="322499">
                <persName>
                  <forename>Mohamed Lamine</forename>
                  <surname>Lamali</surname>
                </persName>
                <email type="md5">261fe46d6cf43ee5353fed66b5f736ab</email>
                <email type="domain">u-bordeaux.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01987354</idno>
            <idno type="halUri">https://hal.science/hal-01987354</idno>
            <idno type="halBibtex">lamali:hal-01987354</idno>
            <idno type="halRefHtml">&lt;i&gt;IEEE INFOCOM 2019 - IEEE Conference on Computer Communications&lt;/i&gt;, Apr 2019, Paris, France. pp.1675-1683, &lt;a target="_blank" href="https://dx.doi.org/10.1109/INFOCOM.2019.8737536"&gt;&amp;#x27E8;10.1109/INFOCOM.2019.8737536&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, Apr 2019, Paris, France. pp.1675-1683, &amp;#x27E8;10.1109/INFOCOM.2019.8737536&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1987354-2010064"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-PSUD">Université Paris Sud - Paris XI</idno>
            <idno type="stamp" n="ENSEIRB">Ecole Nationale Supérieure d'Electronique, Informatique et Radiocommunications de Bordeaux</idno>
            <idno type="stamp" n="UNIV-BORDEAUX">Université de Bordeaux</idno>
            <idno type="stamp" n="UMR8623">Laboratoire de Recherche en Informatique</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="LRI-GALAC" corresp="UMR8623">Equipe : Graphes, Algorithmes et Combinatoire</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIV-PSUD-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris Sud pour Paris Saclay</idno>
            <idno type="stamp" n="CENTRALESUPELEC-SACLAY" corresp="UNIV-PARIS-SACLAY">CENTRALESUPELEC-SACLAY</idno>
            <idno type="stamp" n="TEST-HALCNRS">Collection test HAL CNRS</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="LISN">Laboratoire Interdisciplinaire des Sciences du Numérique</idno>
            <idno type="stamp" n="GS-ENGINEERING">Graduate School Sciences de l'Ingénierie et des Systèmes</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="LISN-GALAC" corresp="LISN">Graphes, Algorithmes et Combinatoire </idno>
            <idno type="stamp" n="UNIVERSITE-BORDEAUX">Université de Bordeaux</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="0">No</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A stack-vector routing protocol for automatic tunneling</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Mohamed Lamine</forename>
                    <surname>Lamali</surname>
                  </persName>
                  <email type="md5">261fe46d6cf43ee5353fed66b5f736ab</email>
                  <email type="domain">u-bordeaux.fr</email>
                  <idno type="idhal" notation="string">mohamed-lamine-lamali</idno>
                  <idno type="idhal" notation="numeric">176101</idno>
                  <idno type="halauthorid" notation="string">38998-176101</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9307-7482</idno>
                  <idno type="IDREF">https://www.idref.fr/185163971</idno>
                  <affiliation ref="#struct-3102"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Simon</forename>
                    <surname>Lassourreuille</surname>
                  </persName>
                  <idno type="halauthorid">1502795-0</idno>
                  <affiliation ref="#struct-3102"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Stephan</forename>
                    <surname>Kunne</surname>
                  </persName>
                  <idno type="halauthorid">1494608-0</idno>
                  <affiliation ref="#struct-399697"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Johanne</forename>
                    <surname>Cohen</surname>
                  </persName>
                  <email type="md5">b26c57c772e91c561ab577a717af43eb</email>
                  <email type="domain">lri.fr</email>
                  <idno type="idhal" notation="string">johanne-cohen</idno>
                  <idno type="idhal" notation="numeric">7467</idno>
                  <idno type="halauthorid" notation="string">23390-7467</idno>
                  <idno type="IDREF">https://www.idref.fr/145022269</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-9548-5260</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000357703658</idno>
                  <idno type="VIAF">https://viaf.org/viaf/200825481</idno>
                  <affiliation ref="#struct-2544"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>IEEE INFOCOM 2019 - IEEE Conference on Computer Communications</title>
                  <date type="start">2019-04-29</date>
                  <date type="end">2019-05-02</date>
                  <settlement>Paris</settlement>
                  <country key="FR">France</country>
                </meeting>
                <imprint>
                  <biblScope unit="pp">1675-1683</biblScope>
                </imprint>
              </monogr>
              <idno type="arxiv">1901.08326</idno>
              <idno type="doi">10.1109/INFOCOM.2019.8737536</idno>
              <ref type="publisher">https://infocom2019.ieee-infocom.org/</ref>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">distributed algorithms</term>
                <term xml:lang="en">Tunneling</term>
                <term xml:lang="en">encapsulation</term>
                <term xml:lang="en">path computation</term>
                <term xml:lang="en">routing protocol</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In a network, a tunnel is a part of a path where a protocol is encapsulated in another one. A tunnel starts with an encapsulation and ends with the corresponding decapsulation. Several tunnels can be nested at some stage, forming a protocol stack. Tunneling is very important nowadays and it is involved in several tasks: IPv4/IPv6 transition, VPNs, security (IPsec, onion routing), etc. However, tunnel establishment is mainly performed manually or by script, which present obvious scalability issues. Some works attempt to automate a part of the process (e.g., TSP, ISATAP, etc.). However, the determination of the tunnel(s) endpoints is not fully automated, especially in the case of an arbitrary number of nested tunnels. The lack of routing protocols performing automatic tunneling is due to the unavailability of path computation algorithms taking into account encapsulations and decapsulations. There is a polynomial centralized algorithm to perform the task. However, to the best of our knowledge, no fully distributed path computation algorithm is known. Here, we propose the first fully distributed algorithm for path computation with automatic tunneling, i.e., taking into account encapsulation, decapsulation and conversion of protocols. Our algorithm is a generalization of the distributed Bellman-Ford algorithm, where the distance vector is replaced by a protocol stack vector. This allows to know how to route a packet with some protocol stack. We prove that the messages size of our algorithm is polynomial, even if the shortest path can be of exponential length. We also prove that the algorithm converges after a polynomial number of steps in a synchronized setting. We adapt our algorithm into a proto-protocol for routing with automatic tunneling and we show its efficiency through simulations.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-3102" status="VALID">
          <idno type="IdRef">155054465</idno>
          <idno type="ISNI">0000000122898198</idno>
          <idno type="RNSR">199511665F</idno>
          <idno type="ROR">https://ror.org/03adqg323</idno>
          <idno type="Wikidata">Q3214395</idno>
          <orgName>Laboratoire Bordelais de Recherche en Informatique</orgName>
          <orgName type="acronym">LaBRI</orgName>
          <date type="start">1988-01-01</date>
          <desc>
            <address>
              <addrLine>Domaine Universitaire 351, cours de la Libération 33405 Talence Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.labri.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-259761" type="direct"/>
            <relation active="#struct-300366" type="direct"/>
            <relation name="UMR5800 / URA1304" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-399697" status="OLD">
          <orgName>Graphes, Algorithmes et Combinatoire (LRI)</orgName>
          <orgName type="acronym">GALaC - LRI</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Université Paris-Sud ; bât. 650 Lovelace ; 91405 Orsay Cedex</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-2544" type="direct"/>
            <relation active="#struct-92966" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation name="UMR8623" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-2544" status="OLD">
          <idno type="RNSR">199812948M</idno>
          <orgName>Laboratoire de Recherche en Informatique</orgName>
          <orgName type="acronym">LRI</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>LRI - Bâtiments 650-660 Université Paris-Sud 91405 Orsay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lri.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-92966" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation name="UMR8623" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-259761" status="VALID">
          <idno type="IdRef">175206562</idno>
          <idno type="ROR">https://ror.org/057qpr032</idno>
          <orgName>Université de Bordeaux</orgName>
          <orgName type="acronym">UB</orgName>
          <desc>
            <address>
              <addrLine>35, place Pey Berland - 33076 Bordeaux</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-bordeaux.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300366" status="VALID">
          <orgName>École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-92966" status="OLD">
          <idno type="ROR">https://ror.org/028rypz17</idno>
          <orgName>Université Paris-Sud - Paris 11</orgName>
          <orgName type="acronym">UP11</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Bâtiment 300 - 91405 Orsay cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-psud.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-48440" status="VALID">
          <idno type="anr">ANR-18-CE25-0002</idno>
          <idno type="program">APPEL À PROJETS GÉNÉRIQUE 2018</idno>
          <orgName>HERA</orgName>
          <desc>HÉtérogénéité et algorithmes de RoutAge dans les réseaux</desc>
          <date type="start">2018</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>