<?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-01056312</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-21T06:00:41+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Efficient Recovery from False State in Distributed Routing Algorithms</title>
            <author role="aut">
              <persName>
                <forename type="first">Daniel</forename>
                <surname>Gyllstrom</surname>
              </persName>
              <idno type="halauthorid">854420-0</idno>
              <affiliation ref="#struct-264684"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sudarshan</forename>
                <surname>Vasudevan</surname>
              </persName>
              <idno type="halauthorid">854421-0</idno>
              <affiliation ref="#struct-264684"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jim</forename>
                <surname>Kurose</surname>
              </persName>
              <idno type="halauthorid">145027-0</idno>
              <affiliation ref="#struct-264684"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Gerome</forename>
                <surname>Miklau</surname>
              </persName>
              <idno type="halauthorid">707272-0</idno>
              <affiliation ref="#struct-264684"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2014-08-18 15:45:12</date>
              <date type="whenModified">2019-08-06 11:38:50</date>
              <date type="whenReleased">2014-08-18 15:54:09</date>
              <date type="whenProduced">2010-05-11</date>
              <date type="whenEndEmbargoed">2014-08-18</date>
              <ref type="file" target="https://inria.hal.science/hal-01056312v1/document">
                <date notBefore="2014-08-18"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01056312v1/file/main.pdf" id="file-1056312-860720">
                <date notBefore="2014-08-18"/>
              </ref>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-642-12963-6_16.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01056312</idno>
            <idno type="halUri">https://inria.hal.science/hal-01056312</idno>
            <idno type="halBibtex">gyllstrom:hal-01056312</idno>
            <idno type="halRefHtml">&lt;i&gt;9th International IFIP TC 6 Networking Conference (NETWORKING)&lt;/i&gt;, May 2010, Chennai, India. pp.198-212, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-12963-6_16"&gt;&amp;#x27E8;10.1007/978-3-642-12963-6_16&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">9th International IFIP TC 6 Networking Conference (NETWORKING), May 2010, Chennai, India. pp.198-212, &amp;#x27E8;10.1007/978-3-642-12963-6_16&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1056312-860720"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-LNCS-6091" corresp="IFIP-LNCS">NETWORKING 2010</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC6" corresp="IFIP-TC">TC 6: Communication Systems</idno>
            <idno type="stamp" n="IFIP-NETWORKING"> IFIP Networking Conference</idno>
            <idno type="stamp" n="IFIP-2010">IFIP-2010</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="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Efficient Recovery from False State in Distributed Routing Algorithms</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Daniel</forename>
                    <surname>Gyllstrom</surname>
                  </persName>
                  <idno type="halauthorid">854420-0</idno>
                  <affiliation ref="#struct-264684"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sudarshan</forename>
                    <surname>Vasudevan</surname>
                  </persName>
                  <idno type="halauthorid">854421-0</idno>
                  <affiliation ref="#struct-264684"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jim</forename>
                    <surname>Kurose</surname>
                  </persName>
                  <idno type="halauthorid">145027-0</idno>
                  <affiliation ref="#struct-264684"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Gerome</forename>
                    <surname>Miklau</surname>
                  </persName>
                  <idno type="halauthorid">707272-0</idno>
                  <affiliation ref="#struct-264684"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>9th International IFIP TC 6 Networking Conference (NETWORKING)</title>
                  <date type="start">2010-05-11</date>
                  <date type="end">2010-05-16</date>
                  <settlement>Chennai</settlement>
                  <country key="IN">India</country>
                </meeting>
                <editor>Mark Crovella; Laura Marie Feeney; Dan Rubenstein; S. V. Raghavan</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">NETWORKING 2010</biblScope>
                  <biblScope unit="volume">LNCS-6091</biblScope>
                  <biblScope unit="pp">198-212</biblScope>
                  <date type="datePub">2010</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-12963-6_16</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Fault Tolerance</term>
                <term xml:lang="en">Checkpointing</term>
                <term xml:lang="en">Recovery</term>
                <term xml:lang="en">Security</term>
                <term xml:lang="en">Routing</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dl">Computer Science [cs]/Digital Libraries [cs.DL]</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>Malicious and misconfigured nodes can inject incorrect state into a distributed system, which can then be propagated system-wide as a result of normal network operation. Such false state can degrade the performance of a distributed system or render it unusable. For example, in the case of network routing algorithms, false state corresponding to a node incorrectly declaring a cost of 0 to all destinations (maliciously or due to misconfiguration) can quickly spread through the network. This causes other nodes to (incorrectly) route via the misconfigured node, resulting in suboptimal routing and network congestion. We propose three algorithms for efficient recovery in such scenarios and prove the correctness of each of these algorithms. Through simulation, we evaluate our algorithms - in terms of message and time overhead - when applied to removing false state in distance vector routing. Our analysis shows that over topologies where link costs remain fixed and for the same topologies where link costs change, a recovery algorithm based on system-wide checkpoints and a rollback mechanism yields superior performance when using the poison reverse optimization.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="department" xml:id="struct-264684" status="VALID">
          <orgName>Department of Computer Science [Amherst]</orgName>
          <desc>
            <address>
              <addrLine>Amherst CollegeP.O. Box 5000Amherst, MA 01002-5000</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">https://www.amherst.edu/academiclife/departments/computer_science</ref>
          </desc>
          <listRelation>
            <relation active="#struct-91189" type="direct"/>
            <relation active="#struct-566334" type="indirect"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-91189" status="VALID">
          <orgName>University of Massachusetts [Amherst]</orgName>
          <orgName type="acronym">UMass Amherst</orgName>
          <desc>
            <address>
              <addrLine>300 Massachusetts Ave, Amherst, MA 01003</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">http://www.umass.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-566334" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-566334" status="VALID">
          <orgName>University of Massachusetts System</orgName>
          <orgName type="acronym">UMASS</orgName>
          <desc>
            <address>
              <country key="US"/>
            </address>
            <ref type="url">https://www.massachusetts.edu/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>