<?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-00589950</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-23T02:06:52+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">An improved stabilizing BFS tree construction</title>
            <author role="crp">
              <persName>
                <forename type="first">Alain</forename>
                <surname>Cournier</surname>
              </persName>
              <email type="md5">04dd45684457979675d455dcae9154da</email>
              <email type="domain">u-picardie.fr</email>
              <idno type="idhal" notation="string">alain-cournier</idno>
              <idno type="idhal" notation="numeric">746492</idno>
              <idno type="halauthorid" notation="string">13016-746492</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/CMU-8884-2022</idno>
              <idno type="IDREF">https://www.idref.fr/117726362</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-4049-0975</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/CMU-8884-2022</idno>
              <affiliation ref="#struct-59714"/>
            </author>
            <author role="crp">
              <persName>
                <forename type="first">Stephane</forename>
                <surname>Rovedakis</surname>
              </persName>
              <email type="md5">6264eef93c489171035971967289070c</email>
              <email type="domain">cnam.fr</email>
              <idno type="idhal" notation="string">stephane-rovedakis</idno>
              <idno type="idhal" notation="numeric">171189</idno>
              <idno type="halauthorid" notation="string">12560-171189</idno>
              <idno type="IDREF">https://www.idref.fr/202420736</idno>
              <idno type="VIAF">https://viaf.org/viaf/63150565585206250054</idno>
              <affiliation ref="#struct-16574"/>
            </author>
            <author role="crp">
              <persName>
                <forename type="first">Vincent</forename>
                <surname>Villain</surname>
              </persName>
              <email type="md5">df7c9c953491c0479945bf7e20197e21</email>
              <email type="domain">u-picardie.fr</email>
              <idno type="idhal" notation="numeric">905601</idno>
              <idno type="halauthorid" notation="string">571398-905601</idno>
              <idno type="IDREF">https://www.idref.fr/035371862</idno>
              <idno type="RESEARCHERID">http://www.researcherid.com/rid/GII-9217-2022</idno>
              <orgName ref="#struct-300258"/>
              <affiliation ref="#struct-59714"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Stephane</forename>
                <surname>Rovedakis</surname>
              </persName>
              <email type="md5">6264eef93c489171035971967289070c</email>
              <email type="domain">cnam.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2011-05-02 19:10:22</date>
              <date type="whenWritten">2011-05-02</date>
              <date type="whenModified">2025-07-09 15:06:18</date>
              <date type="whenReleased">2011-05-03 10:19:41</date>
              <date type="whenProduced">2011-05-02</date>
              <date type="whenEndEmbargoed">2011-05-02</date>
              <ref type="file" target="https://hal.science/hal-00589950v1/document">
                <date notBefore="2011-05-02"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00589950v1/file/bfs.pdf" id="file-589950-780628">
                <date notBefore="2011-05-02"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="137791">
                <persName>
                  <forename>Stephane</forename>
                  <surname>Rovedakis</surname>
                </persName>
                <email type="md5">6264eef93c489171035971967289070c</email>
                <email type="domain">cnam.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00589950</idno>
            <idno type="halUri">https://hal.science/hal-00589950</idno>
            <idno type="halBibtex">cournier:hal-00589950</idno>
            <idno type="halRefHtml">2011</idno>
            <idno type="halRef">2011</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-589950-780628"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-PICARDIE">Université de Picardie Jules Verne</idno>
            <idno type="stamp" n="CNAM">Conservatoire National des Arts et Métiers</idno>
            <idno type="stamp" n="LARA">LARA</idno>
            <idno type="stamp" n="CEDRIC-CNAM" corresp="CNAM">Centre d'études et de recherche en informatique et communications </idno>
            <idno type="stamp" n="U-PICARDIE">Université de Picardie Jules Verne</idno>
            <idno type="stamp" n="MIS" corresp="U-PICARDIE">Modélisation, Information et Systèmes - UR UPJV 4290</idno>
            <idno type="stamp" n="UPJV-MIS-SDMA">Equipe Systèmes Distribués, Mots et Applications du laboratoire Modélisation, Information &amp; Systèmes (Université de Picardie Jules Verne) </idno>
            <idno type="stamp" n="TEST3-HALCNRS">TEST3-HALCNRS</idno>
            <idno type="stamp" n="HESAM-CNAM" corresp="HESAM">Conservatoire National des Arts et Métiers - Hesam</idno>
            <idno type="stamp" n="HESAM">Hesam</idno>
            <idno type="stamp" n="UPJV-MIS-ALCO">Algorithmique et Complexité</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="1">Not set</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">An improved stabilizing BFS tree construction</title>
                <author role="crp">
                  <persName>
                    <forename type="first">Alain</forename>
                    <surname>Cournier</surname>
                  </persName>
                  <email type="md5">04dd45684457979675d455dcae9154da</email>
                  <email type="domain">u-picardie.fr</email>
                  <idno type="idhal" notation="string">alain-cournier</idno>
                  <idno type="idhal" notation="numeric">746492</idno>
                  <idno type="halauthorid" notation="string">13016-746492</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/CMU-8884-2022</idno>
                  <idno type="IDREF">https://www.idref.fr/117726362</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-4049-0975</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/http://www.researcherid.com/rid/CMU-8884-2022</idno>
                  <affiliation ref="#struct-59714"/>
                </author>
                <author role="crp">
                  <persName>
                    <forename type="first">Stephane</forename>
                    <surname>Rovedakis</surname>
                  </persName>
                  <email type="md5">6264eef93c489171035971967289070c</email>
                  <email type="domain">cnam.fr</email>
                  <idno type="idhal" notation="string">stephane-rovedakis</idno>
                  <idno type="idhal" notation="numeric">171189</idno>
                  <idno type="halauthorid" notation="string">12560-171189</idno>
                  <idno type="IDREF">https://www.idref.fr/202420736</idno>
                  <idno type="VIAF">https://viaf.org/viaf/63150565585206250054</idno>
                  <affiliation ref="#struct-16574"/>
                </author>
                <author role="crp">
                  <persName>
                    <forename type="first">Vincent</forename>
                    <surname>Villain</surname>
                  </persName>
                  <email type="md5">df7c9c953491c0479945bf7e20197e21</email>
                  <email type="domain">u-picardie.fr</email>
                  <idno type="idhal" notation="numeric">905601</idno>
                  <idno type="halauthorid" notation="string">571398-905601</idno>
                  <idno type="IDREF">https://www.idref.fr/035371862</idno>
                  <idno type="RESEARCHERID">http://www.researcherid.com/rid/GII-9217-2022</idno>
                  <orgName ref="#struct-300258"/>
                  <affiliation ref="#struct-59714"/>
                </author>
              </analytic>
              <monogr>
                <imprint/>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Distributed algorithm</term>
                <term xml:lang="en">Fault-tolerance</term>
                <term xml:lang="en">Self-stabilization</term>
                <term xml:lang="en">Spanning tree construction</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</classCode>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
              <classCode scheme="halTypology" n="REPORT">Reports</classCode>
              <classCode scheme="halOldTypology" n="REPORT">Reports</classCode>
              <classCode scheme="halTreeTypology" n="REPORT">Reports</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The construction of a spanning tree is a fundamental task in distributed systems which allows to resolve other tasks (i.e., routing, mutual exclusion, network reset). In this paper, we are interested in the problem of constructing a \emph{Breadth First Search} (BFS) tree. \emph{Stabilization} is a versatile technique which ensures that the system recover a correct behaviour from an arbitrary global state resulting from transient faults. A \emph{silent} algorithm always reaches a terminal global state in a finite time. We present a first silent stabilizing algorithm to resolve a problem in which each node requests a permission (delivered by a subset of network nodes) in order to perform a defined computation. Using this first algorithm, we present a silent stabilizing algorithm constructing a BFS tree working in $O(D^2)$ rounds ($D$ is the diameter of the network) under a distributed daemon without any fairness assumptions. The complexity in terms of steps is $O(mn^4)$ where $m$ and $n$ are the number of edges and nodes of the network, respectively, so it is polynomial with respect to $n$. To our knowledge, since in general the diameter of a network is much smaller than the number of nodes, this algorithm gets the best compromise of the literature between the complexities in terms of rounds and in terms of steps.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-59714" status="VALID">
          <idno type="IdRef">197029876</idno>
          <idno type="RNSR">200815526W</idno>
          <idno type="ROR">https://ror.org/05w9qrp28</idno>
          <orgName>Modélisation, Information et Systèmes - UR UPJV 4290</orgName>
          <orgName type="acronym">MIS</orgName>
          <date type="start">2008-01-01</date>
          <desc>
            <address>
              <addrLine>Université de Picardie Jules Verne - UFR des Sciences - 33, rue Saint Leu - 80039 AMIENS CEDEX 1</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.mis.u-picardie.fr/</ref>
          </desc>
          <listRelation>
            <relation name="UR4290" active="#struct-300258" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-16574" status="VALID">
          <idno type="IdRef">155463381</idno>
          <idno type="RNSR">201119480F</idno>
          <idno type="ROR">https://ror.org/044j5mm75</idno>
          <orgName>Centre d'études et de recherche en informatique et communications</orgName>
          <orgName type="acronym">CEDRIC</orgName>
          <desc>
            <address>
              <addrLine>292 rue Saint-Martin 75141 PARIS Cedex 03Case courrier 2D4P30</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://cedric.cnam.fr/</ref>
          </desc>
          <listRelation>
            <relation name="EA4629" active="#struct-179741" type="direct"/>
            <relation name="EA4629" active="#struct-300351" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300258" status="VALID">
          <idno type="IdRef">026403714</idno>
          <idno type="ISNI">0000 0001 0789 1385</idno>
          <idno type="ROR">https://ror.org/01gyxrk03</idno>
          <orgName>Université de Picardie Jules Verne</orgName>
          <orgName type="acronym">UPJV</orgName>
          <desc>
            <address>
              <addrLine>Chemin du Thil - 80000 Amiens</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.u-picardie.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-179741" status="VALID">
          <orgName>Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise</orgName>
          <orgName type="acronym">ENSIIE</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ensiie.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300351" status="VALID">
          <idno type="IdRef">027404978</idno>
          <idno type="ISNI">0000000121690459</idno>
          <idno type="ROR">https://ror.org/0175hh227</idno>
          <orgName>Conservatoire National des Arts et Métiers [Cnam]</orgName>
          <orgName type="acronym">Cnam</orgName>
          <desc>
            <address>
              <addrLine>292 Rue Saint-Martin, 75003 Paris</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.cnam.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>