{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:52:26Z","timestamp":1750308746709,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,9,19]],"date-time":"2004-09-19T00:00:00Z","timestamp":1095552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,9,19]]},"DOI":"10.1145\/1133572.1133612","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["Exploiting semantic clustering in the eDonkey P2P network"],"prefix":"10.1145","author":[{"given":"S. B.","family":"Handurukande","sequence":"first","affiliation":[{"name":"Distributed Programming Laboratory, EPFL, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.-M.","family":"Kermarrec","sequence":"additional","affiliation":[{"name":"INRIA, Rennes, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. Le","family":"Fessant","sequence":"additional","affiliation":[{"name":"INRIA-Futurs and Lix, Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Massouli\u00e9","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,9,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"edonkey. http:\/\/www.edonkey2000.com\/index.html.  edonkey. http:\/\/www.edonkey2000.com\/index.html."},{"key":"e_1_3_2_1_2_1","unstructured":"Emule. http:\/\/www.emule-project.net\/.  Emule. http:\/\/www.emule-project.net\/."},{"key":"e_1_3_2_1_3_1","unstructured":"Gnutella http:\/\/www.gnutella.com.  Gnutella http:\/\/www.gnutella.com."},{"key":"e_1_3_2_1_4_1","unstructured":"KazAa. www.kazaa.com.  KazAa. www.kazaa.com."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_24"},{"key":"e_1_3_2_1_6_1","volume-title":"HotNets 2003","author":"Castro M.","year":"2003","unstructured":"M. Castro , M. Costa , and A. Rowstron . Should we build gnutella on a structured overlay ? In HotNets 2003 , Boston, MA, USA , Nov 2003 . M. Castro, M. Costa, and A. Rowstron. Should we build gnutella on a structured overlay? In HotNets 2003, Boston, MA, USA, Nov 2003."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.864000"},{"key":"e_1_3_2_1_8_1","first-page":"2","volume-title":"Semantic overlay networks for","author":"Crespo A.","year":"2003","unstructured":"A. Crespo and H. Garcia-Molina . Semantic overlay networks for p 2 p systems. Technical report, Stanford University , 2003 . A. Crespo and H. Garcia-Molina. Semantic overlay networks for p2p systems. Technical report, Stanford University, 2003."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30183-7_21"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945475"},{"key":"e_1_3_2_1_11_1","unstructured":"http:\/\/bitconjurer.org\/BitTorrent\/. Bittorrent.  http:\/\/bitconjurer.org\/BitTorrent\/. Bittorrent."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30183-7_14"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/514191.514206"},{"key":"e_1_3_2_1_14_1","volume-title":"Napster traffic measurement. Technical report","author":"Plonka D.","year":"2000","unstructured":"D. Plonka . Napster traffic measurement. Technical report , University of Wisconsin-Madison , 2000 . D. Plonka. Napster traffic measurement. Technical report, University of Wisconsin-Madison, 2000."},{"key":"e_1_3_2_1_15_1","volume-title":"Middleware","author":"Rowstron A.","year":"2001","unstructured":"A. Rowstron and P. Druschel . Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems . In Middleware , 2001 . A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Middleware, 2001."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060319"},{"key":"e_1_3_2_1_17_1","volume-title":"MMCN'02","author":"Saroiu S.","year":"2002","unstructured":"S. Saroiu and S. G. P. Krishna Gummadi . A measurement study of peer-to-peer file sharing systems . In MMCN'02 , Jan. 2002 . S. Saroiu and S. G. P. Krishna Gummadi. A measurement study of peer-to-peer file sharing systems. In MMCN'02, Jan. 2002."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637222"},{"volume-title":"INFOCOM'03","author":"Sripanidkulchai K.","key":"e_1_3_2_1_19_1","unstructured":"K. Sripanidkulchai , B. Maggs , and H. Zhang . Efficient content location using interest-based locality in peer-to-peer systems . In INFOCOM'03 . K. Sripanidkulchai, B. Maggs, and H. Zhang. Efficient content location using interest-based locality in peer-to-peer systems. In INFOCOM'03."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/998674.999375"},{"key":"e_1_3_2_1_22_1","volume-title":"http:\/\/news.com.com\/2100-1025_3-5091230.html","author":"Wearden G.","year":"2003","unstructured":"G. Wearden . eDonkey pulls ahead in European P2 P race. http:\/\/news.com.com\/2100-1025_3-5091230.html , 2003 . G. Wearden. eDonkey pulls ahead in European P2P race. http:\/\/news.com.com\/2100-1025_3-5091230.html, 2003."}],"event":{"name":"EW04: ACM SIGOPS European Workshop 2004","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Leuven Belgium","acronym":"EW04"},"container-title":["Proceedings of the 11th workshop on ACM SIGOPS European workshop"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1133572.1133612","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1133572.1133612","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:22:17Z","timestamp":1750278137000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1133572.1133612"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9,19]]},"references-count":22,"alternative-id":["10.1145\/1133572.1133612","10.1145\/1133572"],"URL":"https:\/\/doi.org\/10.1145\/1133572.1133612","relation":{},"subject":[],"published":{"date-parts":[[2004,9,19]]},"assertion":[{"value":"2004-09-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}