<?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 inria-00001249</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-14T12:56:50+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">PROXSEM: Interest-based Proximity Measure to Improve Search Efficiency in P2P Systems</title>
            <author role="aut">
              <persName>
                <forename type="first">Yann</forename>
                <surname>Busnel</surname>
              </persName>
              <email type="md5">4480a2e853bef7e22af2761cb4a4b313</email>
              <email type="domain">imt.fr</email>
              <idno type="idhal" notation="string">yann-busnel</idno>
              <idno type="idhal" notation="numeric">823</idno>
              <idno type="halauthorid" notation="string">2543327-823</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6908-719X</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=Yet2gQkAAAAJ</idno>
              <idno type="IDREF">https://www.idref.fr/129816647</idno>
              <idno type="ARXIV">https://arxiv.org/a/busnel_y_1</idno>
              <affiliation ref="#struct-2526"/>
              <affiliation ref="#struct-105159"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Yann</forename>
                <surname>Busnel</surname>
              </persName>
              <email type="md5">4480a2e853bef7e22af2761cb4a4b313</email>
              <email type="domain">imt.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2006-04-12 13:50:06</date>
              <date type="whenModified">2025-03-28 03:08:58</date>
              <date type="whenReleased">2006-04-18 11:34:33</date>
              <date type="whenProduced">2006-04-19</date>
              <date type="whenEndEmbargoed">2006-04-12</date>
              <ref type="file" target="https://inria.hal.science/inria-00001249v1/document">
                <date notBefore="2006-04-12"/>
              </ref>
              <ref type="file" n="1" target="https://inria.hal.science/inria-00001249v1/file/abstractPosterEurosys06.pdf" id="file-65578-648570">
                <date notBefore="2006-04-12"/>
              </ref>
              <ref type="file" n="0" target="https://inria.hal.science/inria-00001249v1/file/posterEurosys06.pdf" id="file-65578-648571">
                <date notBefore="2006-04-12"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="108751">
                <persName>
                  <forename>Yann</forename>
                  <surname>Busnel</surname>
                </persName>
                <email type="md5">4480a2e853bef7e22af2761cb4a4b313</email>
                <email type="domain">imt.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">inria-00001249</idno>
            <idno type="halUri">https://inria.hal.science/inria-00001249</idno>
            <idno type="halBibtex">busnel:inria-00001249</idno>
            <idno type="halRefHtml">&lt;i&gt;EuroSys2006&lt;/i&gt;, Apr 2006, Leuven/Belgium</idno>
            <idno type="halRef">EuroSys2006, Apr 2006, Leuven/Belgium</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-65578-648570"/><ref corresp="#file-65578-648571"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="EC-PARIS">Ecole Centrale Paris</idno>
            <idno type="stamp" n="UNIV-RENNES1">Université de Rennes 1</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="ENS-CACHAN">Ecole Normale Supérieure de Cachan</idno>
            <idno type="stamp" n="INSA-RENNES">Institut National des Sciences Appliquées de Rennes</idno>
            <idno type="stamp" n="INRIA-RENNES">INRIA Rennes - Bretagne Atlantique</idno>
            <idno type="stamp" n="IRISA">Irisa</idno>
            <idno type="stamp" n="IRISA_SET">IRISA_SET</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UR1-HAL">Publications labos UR1 dans HAL-Rennes 1</idno>
            <idno type="stamp" n="UR1-MATH-STIC">UR1 - publications Maths-STIC</idno>
            <idno type="stamp" n="UR1-UFR-ISTIC">UFR ISTIC Informatique et électronique</idno>
            <idno type="stamp" n="TEST-UNIV-RENNES">TEST Université de Rennes</idno>
            <idno type="stamp" n="TEST-UR-CSS">TEST Université de Rennes CSS</idno>
            <idno type="stamp" n="UNIV-RENNES">Université de Rennes</idno>
            <idno type="stamp" n="INRIA-RENGRE">INRIA-RENGRE</idno>
            <idno type="stamp" n="INSA-GROUPE">Groupe INSA</idno>
            <idno type="stamp" n="UR1-MATH-NUM">Pôle UnivRennes - Mathématiques - Numérique </idno>
            <idno type="stamp" n="ENS-PARIS-SACLAY">Ecole Normale Supérieure paris-Saclay</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="1">Not set</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">PROXSEM: Interest-based Proximity Measure to Improve Search Efficiency in P2P Systems</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Yann</forename>
                    <surname>Busnel</surname>
                  </persName>
                  <email type="md5">4480a2e853bef7e22af2761cb4a4b313</email>
                  <email type="domain">imt.fr</email>
                  <idno type="idhal" notation="string">yann-busnel</idno>
                  <idno type="idhal" notation="numeric">823</idno>
                  <idno type="halauthorid" notation="string">2543327-823</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6908-719X</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=Yet2gQkAAAAJ</idno>
                  <idno type="IDREF">https://www.idref.fr/129816647</idno>
                  <idno type="ARXIV">https://arxiv.org/a/busnel_y_1</idno>
                  <affiliation ref="#struct-2526"/>
                  <affiliation ref="#struct-105159"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>EuroSys2006</title>
                  <date type="start">2006-04-19</date>
                  <settlement>Leuven/Belgium</settlement>
                </meeting>
                <imprint>
                  <date type="datePub">2006-04-19</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="acm" n="H.3.3">H.: Information Systems/H.3: INFORMATION STORAGE AND RETRIEVAL/H.3.3: Information Search and Retrieval</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>Peer-to-peer file sharing systems are now at the origin of most of Internet traffic. Improving the performance of such systems has generated a lot of interest both in industry and academia. More specifically, many approaches focus on the improvement of the query mechanism in such systems. In a peer-to-peer system, peers are connected to a subset of other peers with which they can communicate. Each peer maintains a cache and makes available its contents to the rest of the system. Connecting peers sharing similar interest in the context of a given application has recently been identified as a sound basis to improve the search efficiency. However, capturing such interest-based (or semantic) proximity patterns is a difficult task. Most of current approaches measure this proximity between peers as the overlap between their cache contents. Given the well-known popularity patterns of peer-to-peer file sharing systems, the overlap between cache contents of two peers may not reflect accurately their semantic proximity. More specifically, this measure depends upon peer generosity and file popularity. In this poster, we propose a refined proximity measure taking into account these factors. We evaluated the proposed solution by simulation against a real peer-to-peer system (eDonkey) workload. We obtain results which shown the effectiveness of the proposed approach: taking into account file popularity increases the one hop hit ratio (23 \% of success against 1\% for random search and 17 \% for overlap size measure); taking into account peer generosity balances generous nodes load (the maximum in-degree of the network is 990 against 1702 with overlap strategy). While peers generosity can easily be computed locally, file popularity may require a global knowledge of the system. We also propose in this study an epidemic algorithm to compute in a fully decentralised way an estimation of files popularity.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-2526" status="OLD">
          <idno type="RNSR">199918356L</idno>
          <orgName>Programming distributed parallel systems for large scale numerical simulation</orgName>
          <orgName type="acronym">PARIS</orgName>
          <date type="start">1999-12-14</date>
          <date type="end">2009-12-31</date>
          <desc>
            <address>
              <addrLine>Campus de Beaulieu, 35042 Rennes cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/paris</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2494" type="direct"/>
            <relation active="#struct-105160" type="indirect"/>
            <relation active="#struct-117606" type="indirect"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation name="ESA6074 / URA227" active="#struct-441569" type="indirect"/>
            <relation active="#struct-6862" type="direct"/>
            <relation active="#struct-419153" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-105159" status="VALID">
          <orgName>Département Informatique et Télécommunications</orgName>
          <orgName type="acronym">DIT</orgName>
          <desc>
            <address>
              <addrLine>ENS Cachan - Antenne de Bretagne Campus de Ker Lann 35170 Bruz</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.dit.bretagne.ens-cachan.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-6862" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-2494" status="OLD">
          <orgName>Institut de Recherche en Informatique et Systèmes Aléatoires</orgName>
          <orgName type="acronym">IRISA</orgName>
          <date type="start">1980-01-01</date>
          <date type="end">1999-12-31</date>
          <desc>
            <address>
              <addrLine>Campus universitaire de Beaulieu - 35042 Rennes</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.irisa.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-105160" type="direct"/>
            <relation active="#struct-117606" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-300009" type="direct"/>
            <relation name="ESA6074 / URA227" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-105160" status="VALID">
          <idno type="IdRef">26693823X</idno>
          <idno type="ROR">https://ror.org/015m7wh34</idno>
          <orgName>Université de Rennes</orgName>
          <orgName type="acronym">UR</orgName>
          <desc>
            <address>
              <addrLine>Campus de Beaulieu, 263 avenue Général Leclerc, CS 74205, 35042 RENNES CEDEX</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.univ-rennes.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-117606" status="VALID">
          <idno type="ROR">https://ror.org/04xaa4j22</idno>
          <orgName>Institut National des Sciences Appliquées - Rennes</orgName>
          <orgName type="acronym">INSA Rennes</orgName>
          <desc>
            <address>
              <addrLine>20, avenue des Buttes de Coësmes - CS 70839 - 35708 Rennes cedex 7</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-rennes.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301232" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </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-6862" status="VALID">
          <orgName>École normale supérieure - Cachan</orgName>
          <orgName type="acronym">ENS Cachan</orgName>
          <desc>
            <address>
              <addrLine>61, avenue du Président Wilson - 94230 Cachan</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-cachan.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-419153" status="VALID">
          <idno type="RNSR">198018249C</idno>
          <idno type="ROR">https://ror.org/04040yw90</idno>
          <orgName>Centre Inria de l'Université de Rennes</orgName>
          <desc>
            <address>
              <addrLine>Campus de beaulieu35042 Rennes cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/rennes</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>