<?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-01531969</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-21T10:21:08+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Obscure Giants: Detecting the Provider-Free ASes</title>
            <author role="aut">
              <persName>
                <forename type="first">Syed</forename>
                <surname>Hasan</surname>
              </persName>
              <email type="md5">5a4610b02d4b497e8be07a8067fab543</email>
              <email type="domain">imdea.org</email>
              <idno type="idhal" notation="numeric">1009384</idno>
              <idno type="halauthorid" notation="string">1176259-1009384</idno>
              <affiliation ref="#struct-251112"/>
              <affiliation ref="#struct-45695"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sergey</forename>
                <surname>Gorinsky</surname>
              </persName>
              <email type="md5">8ff20a0e8018ceb5575ad32bab45221c</email>
              <email type="domain">imdea.org</email>
              <idno type="idhal" notation="numeric">1009385</idno>
              <idno type="halauthorid" notation="string">854434-1009385</idno>
              <affiliation ref="#struct-251112"/>
            </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">2017-06-02 11:23:27</date>
              <date type="whenModified">2026-02-02 14:50:05</date>
              <date type="whenReleased">2017-06-02 11:25:01</date>
              <date type="whenProduced">2012-05-21</date>
              <date type="whenEndEmbargoed">2015-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01531969v1/document">
                <date notBefore="2015-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01531969v1/file/978-3-642-30054-7_12_Chapter.pdf" id="file-1531969-1592667">
                <date notBefore="2015-01-01"/>
              </ref>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-642-30054-7_12.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-01531969</idno>
            <idno type="halUri">https://inria.hal.science/hal-01531969</idno>
            <idno type="halBibtex">hasan:hal-01531969</idno>
            <idno type="halRefHtml">&lt;i&gt;11th International Networking Conference (NETWORKING)&lt;/i&gt;, May 2012, Prague, Czech Republic. pp.149-160, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-30054-7_12"&gt;&amp;#x27E8;10.1007/978-3-642-30054-7_12&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.149-160, &amp;#x27E8;10.1007/978-3-642-30054-7_12&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1531969-1592667"/></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-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-LNCS-7290" corresp="IFIP-LNCS">NETWORKING 2012</idno>
            <idno type="stamp" n="IFIP-NETWORKING"> IFIP Networking Conference</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 3: Interdomain</note>
            <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">Obscure Giants: Detecting the Provider-Free ASes</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Syed</forename>
                    <surname>Hasan</surname>
                  </persName>
                  <email type="md5">5a4610b02d4b497e8be07a8067fab543</email>
                  <email type="domain">imdea.org</email>
                  <idno type="idhal" notation="numeric">1009384</idno>
                  <idno type="halauthorid" notation="string">1176259-1009384</idno>
                  <affiliation ref="#struct-251112"/>
                  <affiliation ref="#struct-45695"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sergey</forename>
                    <surname>Gorinsky</surname>
                  </persName>
                  <email type="md5">8ff20a0e8018ceb5575ad32bab45221c</email>
                  <email type="domain">imdea.org</email>
                  <idno type="idhal" notation="numeric">1009385</idno>
                  <idno type="halauthorid" notation="string">854434-1009385</idno>
                  <affiliation ref="#struct-251112"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>11th International Networking Conference (NETWORKING)</title>
                  <date type="start">2012-05-21</date>
                  <date type="end">2012-05-25</date>
                  <settlement>Prague</settlement>
                  <country key="CZ">Czech Republic</country>
                </meeting>
                <editor>Robert Bestak</editor>
                <editor>Lukas Kencl</editor>
                <editor>Li Erran Li</editor>
                <editor>Joerg Widmer</editor>
                <editor>Hao Yin</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">NETWORKING 2012</biblScope>
                  <biblScope unit="volume">LNCS-7290</biblScope>
                  <biblScope unit="issue">Part II</biblScope>
                  <biblScope unit="pp">149-160</biblScope>
                  <date type="datePub">2012</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-30054-7_12</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">provider-free ASes</term>
                <term xml:lang="en">transit</term>
                <term xml:lang="en">Internet economics</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</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>Internet routing depends on economic relationships between ASes (Autonomous Systems). Despite extensive prior research of these relationships, their characterization remains imprecise. In this paper, we focus on provider-free ASes that reach the entire Internet without paying anyone for the traffic delivery. While the ground truth about PFS (set of the provider-free ASes) lies outside the public domain, we use trustworthy non-verifiable sources as a baseline for result validation. Straightforward extraction of PFS from public datasets of inter-AS economic relationships yields poor results. Then, we develop a more sophisticated Temporal Cone (TC) algorithm that relies on topological statistics (customer cones of ASes) and exploits the temporal diversity of the datasets. Our evaluation shows that the TC algorithm infers PFS from the same public datasets with a significantly higher accuracy. We also assess the sensitivity of the TC algorithm to its parameters.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 6</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-251112" status="VALID">
          <idno type="ROR">https://ror.org/04mm9fg30</idno>
          <orgName>Institute IMDEA Networks [Madrid]</orgName>
          <desc>
            <address>
              <addrLine>Avenida del Mar Mediterráneo, 22 28918 Leganés Madrid</addrLine>
              <country key="ES"/>
            </address>
            <ref type="url">http://www.networks.imdea.org/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-45695" status="VALID">
          <idno type="ROR">https://ror.org/03ths8210</idno>
          <orgName>Universidad Carlos III de Madrid = University of Carlos III of Madrid</orgName>
          <orgName type="acronym">UC3M</orgName>
          <desc>
            <address>
              <addrLine>Calle Madrid 126, 28903 Getafe, Madrid</addrLine>
              <country key="ES"/>
            </address>
            <ref type="url">http://www.uc3m.es/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>