<?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-01531122</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-21T07:16:59+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Towards a Robust Framework of Network Coordinate Systems</title>
            <author role="aut">
              <persName>
                <forename type="first">Linpeng</forename>
                <surname>Tang</surname>
              </persName>
              <email type="md5">c59b48ae225d4db40992c63ba56c113d</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="numeric">1009231</idno>
              <idno type="halauthorid" notation="string">1175673-1009231</idno>
              <affiliation ref="#struct-233961"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Zhiyong</forename>
                <surname>Shen</surname>
              </persName>
              <email type="md5">9644aeccc58c505f0596ad47cc91a591</email>
              <email type="domain">hp.com</email>
              <idno type="idhal" notation="numeric">1009232</idno>
              <idno type="halauthorid" notation="string">1175674-1009232</idno>
              <affiliation ref="#struct-496132"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Qunyang</forename>
                <surname>Lin</surname>
              </persName>
              <email type="md5">8adcb1aed5bf5d55f003be7f99337202</email>
              <email type="domain">hp.com</email>
              <idno type="idhal" notation="numeric">1009233</idno>
              <idno type="halauthorid" notation="string">1175675-1009233</idno>
              <affiliation ref="#struct-496132"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Junqing</forename>
                <surname>Xie</surname>
              </persName>
              <email type="md5">3219435c7cb85797cbfa399571031b17</email>
              <email type="domain">hp.com</email>
              <idno type="idhal" notation="numeric">1009234</idno>
              <idno type="halauthorid" notation="string">1175676-1009234</idno>
              <affiliation ref="#struct-496132"/>
            </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-01 11:34:57</date>
              <date type="whenModified">2025-03-03 11:06:26</date>
              <date type="whenReleased">2017-06-01 11:37:50</date>
              <date type="whenProduced">2012-05-21</date>
              <date type="whenEndEmbargoed">2015-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01531122v1/document">
                <date notBefore="2015-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01531122v1/file/978-3-642-30045-5_25_Chapter.pdf" id="file-1531122-1591977">
                <date notBefore="2015-01-01"/>
              </ref>
              <ref type="externalLink" target="https://link.springer.com/content/pdf/10.1007%2F978-3-642-30045-5_25.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-01531122</idno>
            <idno type="halUri">https://inria.hal.science/hal-01531122</idno>
            <idno type="halBibtex">tang:hal-01531122</idno>
            <idno type="halRefHtml">&lt;i&gt;11th International Networking Conference (NETWORKING)&lt;/i&gt;, May 2012, Prague, Czech Republic. pp.331-343, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-642-30045-5_25"&gt;&amp;#x27E8;10.1007/978-3-642-30045-5_25&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">11th International Networking Conference (NETWORKING), May 2012, Prague, Czech Republic. pp.331-343, &amp;#x27E8;10.1007/978-3-642-30045-5_25&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1531122-1591977"/></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-7289" corresp="IFIP-LNCS">NETWORKING 2012</idno>
            <idno type="stamp" n="IFIP-NETWORKING"> IFIP Networking Conference</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 7: Network Mapping</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">Towards a Robust Framework of Network Coordinate Systems</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Linpeng</forename>
                    <surname>Tang</surname>
                  </persName>
                  <email type="md5">c59b48ae225d4db40992c63ba56c113d</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="numeric">1009231</idno>
                  <idno type="halauthorid" notation="string">1175673-1009231</idno>
                  <affiliation ref="#struct-233961"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Zhiyong</forename>
                    <surname>Shen</surname>
                  </persName>
                  <email type="md5">9644aeccc58c505f0596ad47cc91a591</email>
                  <email type="domain">hp.com</email>
                  <idno type="idhal" notation="numeric">1009232</idno>
                  <idno type="halauthorid" notation="string">1175674-1009232</idno>
                  <affiliation ref="#struct-496132"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Qunyang</forename>
                    <surname>Lin</surname>
                  </persName>
                  <email type="md5">8adcb1aed5bf5d55f003be7f99337202</email>
                  <email type="domain">hp.com</email>
                  <idno type="idhal" notation="numeric">1009233</idno>
                  <idno type="halauthorid" notation="string">1175675-1009233</idno>
                  <affiliation ref="#struct-496132"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Junqing</forename>
                    <surname>Xie</surname>
                  </persName>
                  <email type="md5">3219435c7cb85797cbfa399571031b17</email>
                  <email type="domain">hp.com</email>
                  <idno type="idhal" notation="numeric">1009234</idno>
                  <idno type="halauthorid" notation="string">1175676-1009234</idno>
                  <affiliation ref="#struct-496132"/>
                </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-7289</biblScope>
                  <biblScope unit="issue">Part I</biblScope>
                  <biblScope unit="pp">331-343</biblScope>
                  <date type="datePub">2012</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-642-30045-5_25</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Matrix Factorization</term>
                <term xml:lang="en">Metric Space Embedding</term>
                <term xml:lang="en">Robust Error Measure</term>
                <term xml:lang="en">Network Coordinate Systems</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>Network Coordinate System (NCS) is an efficient and scalable mechanism to predict latency between any two network hosts based on historical measurements. Most NCS models, such as metric space embedding based, like Vivaldi, and matrix factorization based, like DMF and Phoenix, use squared error measure in training which suffers from the erroneous records, i.e. the records with large noise. To overcome this drawback, we introduce an elegant error measure, the Huber norm to network latency prediction. The Huber norm shows its robustness to the large data noise while remaining efficiency of optimization. Based on that, we upgrade the traditional NCS models into more robust versions, namely Robust Vivaldi model and Robust Matrix Factorization model. We conduct extensive experiments to compare the proposed models with traditional ones and the results show that our approaches significantly increase the accuracy of network latency prediction.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 6</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-233961" status="VALID">
          <idno type="IdRef">150102984</idno>
          <idno type="ROR">https://ror.org/0220qvk04</idno>
          <orgName>Shanghai Jiao Tong University [Shanghai]</orgName>
          <date type="start">1896-01-01</date>
          <desc>
            <address>
              <addrLine>800 Dongchuan Road, Shanghai, 200240</addrLine>
              <country key="CN"/>
            </address>
            <ref type="url">http://en.sjtu.edu.cn/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-496132" status="VALID">
          <orgName>HP Labs China [Beijing]</orgName>
          <date type="start">2017-05-31</date>
          <desc>
            <address>
              <country key="CN"/>
            </address>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>