Content pollution quantification in large P2P networks : A measurement study on KAD
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 polluti...
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 33 |
|---|---|
| container_issue | |
| container_start_page | 30 |
| container_title | |
| container_volume | |
| creator | Montassier, G. Cholez, T. Doyen, G. Khatoun, R. Chrisment, I. Festor, O. |
| description | 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. |
| doi_str_mv | 10.1109/P2P.2011.6038658 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>hal_6IE</sourceid><recordid>TN_cdi_ieee_primary_6038658</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6038658</ieee_id><sourcerecordid>oai_HAL_inria_00619965v1</sourcerecordid><originalsourceid>FETCH-LOGICAL-h253t-6ebb9d3c001c74f2bcf3a9ba4e2fac10e3f0d737edb26e135d12220cf60ce0c3</originalsourceid><addsrcrecordid>eNo9kFFLwzAUhSMqOOfeBV_yLp25SZMuvpVNnThw4N5Lmt64aNfONlX2761u7LxcDnz3Hu4h5BrYGIDpuyVfjjkDGCsmJkpOTsglxDJJGMRanx6NZPyMDDgoiISU-oKM2vaD9VJKx8lkQN6mdRWwCnRbl2UXfF3Rr85UwTtvzb_1FS1N8460j6QVhp-6-WzpPU3pBk3bNbj5W29DV-xoj7-ksyty7kzZ4ugwh2T1-LCazqPF69PzNF1Eay5FiBTmuS6EZQxsEjueWyeMzk2M3BkLDIVjRSISLHKuEIQsgHPOrFPMIrNiSG73Z9emzLaN35hml9XGZ_N0kfmq8Sbr_wStlfyGnr7Z0x4Rj_ihPfELjTNg2A</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Content pollution quantification in large P2P networks : A measurement study on KAD</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Montassier, G. ; Cholez, T. ; Doyen, G. ; Khatoun, R. ; Chrisment, I. ; Festor, O.</creator><creatorcontrib>Montassier, G. ; Cholez, T. ; Doyen, G. ; Khatoun, R. ; Chrisment, I. ; Festor, O.</creatorcontrib><description>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.</description><identifier>ISSN: 2161-3559</identifier><identifier>ISBN: 1457701502</identifier><identifier>ISBN: 9781457701504</identifier><identifier>EISBN: 1457701499</identifier><identifier>EISBN: 1457701480</identifier><identifier>EISBN: 9781457701481</identifier><identifier>EISBN: 9781457701498</identifier><identifier>DOI: 10.1109/P2P.2011.6038658</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer Science ; Conferences ; Indexes ; KAD ; Measurement ; Monitoring ; Networking and Internet Architecture ; Peer to peer computing ; Pollution ; pollution detection ; pollution of contents ; USA Councils</subject><ispartof>2011 IEEE International Conference on Peer-to-Peer Computing, 2011, p.30-33</ispartof><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><orcidid>0000-0002-0435-3909 ; 0000-0002-7714-8711</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6038658$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,309,310,780,784,789,790,885,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6038658$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://inria.hal.science/inria-00619965$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Montassier, G.</creatorcontrib><creatorcontrib>Cholez, T.</creatorcontrib><creatorcontrib>Doyen, G.</creatorcontrib><creatorcontrib>Khatoun, R.</creatorcontrib><creatorcontrib>Chrisment, I.</creatorcontrib><creatorcontrib>Festor, O.</creatorcontrib><title>Content pollution quantification in large P2P networks : A measurement study on KAD</title><title>2011 IEEE International Conference on Peer-to-Peer Computing</title><addtitle>P2P</addtitle><description>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.</description><subject>Computer Science</subject><subject>Conferences</subject><subject>Indexes</subject><subject>KAD</subject><subject>Measurement</subject><subject>Monitoring</subject><subject>Networking and Internet Architecture</subject><subject>Peer to peer computing</subject><subject>Pollution</subject><subject>pollution detection</subject><subject>pollution of contents</subject><subject>USA Councils</subject><issn>2161-3559</issn><isbn>1457701502</isbn><isbn>9781457701504</isbn><isbn>1457701499</isbn><isbn>1457701480</isbn><isbn>9781457701481</isbn><isbn>9781457701498</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2011</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9kFFLwzAUhSMqOOfeBV_yLp25SZMuvpVNnThw4N5Lmt64aNfONlX2761u7LxcDnz3Hu4h5BrYGIDpuyVfjjkDGCsmJkpOTsglxDJJGMRanx6NZPyMDDgoiISU-oKM2vaD9VJKx8lkQN6mdRWwCnRbl2UXfF3Rr85UwTtvzb_1FS1N8460j6QVhp-6-WzpPU3pBk3bNbj5W29DV-xoj7-ksyty7kzZ4ugwh2T1-LCazqPF69PzNF1Eay5FiBTmuS6EZQxsEjueWyeMzk2M3BkLDIVjRSISLHKuEIQsgHPOrFPMIrNiSG73Z9emzLaN35hml9XGZ_N0kfmq8Sbr_wStlfyGnr7Z0x4Rj_ihPfELjTNg2A</recordid><startdate>201108</startdate><enddate>201108</enddate><creator>Montassier, G.</creator><creator>Cholez, T.</creator><creator>Doyen, G.</creator><creator>Khatoun, R.</creator><creator>Chrisment, I.</creator><creator>Festor, O.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0002-0435-3909</orcidid><orcidid>https://orcid.org/0000-0002-7714-8711</orcidid></search><sort><creationdate>201108</creationdate><title>Content pollution quantification in large P2P networks : A measurement study on KAD</title><author>Montassier, G. ; Cholez, T. ; Doyen, G. ; Khatoun, R. ; Chrisment, I. ; Festor, O.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-h253t-6ebb9d3c001c74f2bcf3a9ba4e2fac10e3f0d737edb26e135d12220cf60ce0c3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Computer Science</topic><topic>Conferences</topic><topic>Indexes</topic><topic>KAD</topic><topic>Measurement</topic><topic>Monitoring</topic><topic>Networking and Internet Architecture</topic><topic>Peer to peer computing</topic><topic>Pollution</topic><topic>pollution detection</topic><topic>pollution of contents</topic><topic>USA Councils</topic><toplevel>online_resources</toplevel><creatorcontrib>Montassier, G.</creatorcontrib><creatorcontrib>Cholez, T.</creatorcontrib><creatorcontrib>Doyen, G.</creatorcontrib><creatorcontrib>Khatoun, R.</creatorcontrib><creatorcontrib>Chrisment, I.</creatorcontrib><creatorcontrib>Festor, O.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Montassier, G.</au><au>Cholez, T.</au><au>Doyen, G.</au><au>Khatoun, R.</au><au>Chrisment, I.</au><au>Festor, O.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Content pollution quantification in large P2P networks : A measurement study on KAD</atitle><btitle>2011 IEEE International Conference on Peer-to-Peer Computing</btitle><stitle>P2P</stitle><date>2011-08</date><risdate>2011</risdate><spage>30</spage><epage>33</epage><pages>30-33</pages><issn>2161-3559</issn><isbn>1457701502</isbn><isbn>9781457701504</isbn><eisbn>1457701499</eisbn><eisbn>1457701480</eisbn><eisbn>9781457701481</eisbn><eisbn>9781457701498</eisbn><abstract>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.</abstract><pub>IEEE</pub><doi>10.1109/P2P.2011.6038658</doi><tpages>4</tpages><orcidid>https://orcid.org/0000-0002-0435-3909</orcidid><orcidid>https://orcid.org/0000-0002-7714-8711</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2161-3559 |
| ispartof | 2011 IEEE International Conference on Peer-to-Peer Computing, 2011, p.30-33 |
| issn | 2161-3559 |
| language | eng |
| recordid | cdi_ieee_primary_6038658 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Computer Science Conferences Indexes KAD Measurement Monitoring Networking and Internet Architecture Peer to peer computing Pollution pollution detection pollution of contents USA Councils |
| title | Content pollution quantification in large P2P networks : A measurement study on KAD |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T07%3A40%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Content%20pollution%20quantification%20in%20large%20P2P%20networks%20:%20A%20measurement%20study%20on%20KAD&rft.btitle=2011%20IEEE%20International%20Conference%20on%20Peer-to-Peer%20Computing&rft.au=Montassier,%20G.&rft.date=2011-08&rft.spage=30&rft.epage=33&rft.pages=30-33&rft.issn=2161-3559&rft.isbn=1457701502&rft.isbn_list=9781457701504&rft_id=info:doi/10.1109/P2P.2011.6038658&rft_dat=%3Chal_6IE%3Eoai_HAL_inria_00619965v1%3C/hal_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1457701499&rft.eisbn_list=1457701480&rft.eisbn_list=9781457701481&rft.eisbn_list=9781457701498&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6038658&rfr_iscdi=true |