3527 articles – 5249 Notices  [english version]

inria-00619965, version 1

Content Pollution Quantification in Large P2P networks : a Measurement Study on KAD

Guillaume Montassier () 1, Thibault Cholez () 1, Guillaume Doyen () 1, 2, Rida Khatoun () 1, Isabelle Chrisment () 3, Olivier Festor () 3

11th IEEE International Conference on Peer-to-Peer Computing (IEEE P2P'11) (2011) 30-33

Résumé : Content pollution is one of the major issues affecting P2P file sharing networks. However, since early studies on FastTrack and Overnet, no recent investigation has reported its impact on current P2P networks. In this paper, we present a method and the supporting architecture to quantify the pollution of contents in the KAD network. We first collect information on many popular files shared in this network. Then, we propose a new way to detect content pollution by analyzing all filenames linked to a content with a metric based on the Tversky index and which gives very low error rates. By analyzing a large number of popular files, we show that 2/3 of the contents are polluted, one part by index poisoning but the majority by a new, more dangerous, form of pollution that we call index falsification.

  • 1 :  Université de Technologie de Troyes (UTT)
  • Université de Technologie de Troyes
  • 2 :  Environnement de Réseaux Autonomes (ERA)
  • Université de Technologie de Troyes
  • 3 :  MADYNES (INRIA Lorraine - LORIA)
  • INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
  • Collaboration : LORIA - UTT
  • Domaine : Informatique/Réseaux et télécommunications
  • Mots-clés : KAD – pollution of contents – pollution detection
 
  • inria-00619965, version 1
  • http://hal.inria.fr/inria-00619965
  • oai:hal.inria.fr:inria-00619965
  • Contributeur : Thibault Cholez <>
  • Soumis le : Mercredi 7 Septembre 2011, 09:28:08
  • Dernière modification le : Jeudi 22 Décembre 2011, 14:13:33