{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T22:31:53Z","timestamp":1772317913563,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,10,25]],"date-time":"2006-10-25T00:00:00Z","timestamp":1161734400000},"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":[[2006,10,25]]},"DOI":"10.1145\/1177080.1177106","type":"proceedings-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T01:15:56Z","timestamp":1168996556000},"page":"203-216","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":230,"title":["Rarest first and choke algorithms are enough"],"prefix":"10.1145","author":[{"given":"Arnaud","family":"Legout","sequence":"first","affiliation":[{"name":"I.N.R.I.A., Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Urvoy-Keller","sequence":"additional","affiliation":[{"name":"Institut Eurecom, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Michiardi","sequence":"additional","affiliation":[{"name":"Institut Eurecom, Sophia Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,10,25]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"http:\/\/www.slyck.com.  http:\/\/www.slyck.com."},{"key":"e_1_3_2_1_2_1","unstructured":"http:\/\/www.bittorrent.com\/.  http:\/\/www.bittorrent.com\/."},{"key":"e_1_3_2_1_3_1","volume-title":"June","year":"2005","unstructured":"Bittorrent protocol specification v1.0. http:\/\/wiki.theory.org\/BitTorrentSpecification , June 2005 . Bittorrent protocol specification v1.0. http:\/\/wiki.theory.org\/BitTorrentSpecification, June 2005."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45172-3_24"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.328"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30193-6_1"},{"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","volume-title":"Proc. First Workshop on Economics of Peer-to-Peer Systems","author":"Cohen B.","year":"2003","unstructured":"B. Cohen . Incentives build robustness in bittorrent . In Proc. First Workshop on Economics of Peer-to-Peer Systems , Berkeley, USA , June 2003 . B. Cohen. Incentives build robustness in bittorrent. In Proc. First Workshop on Economics of Peer-to-Peer Systems, Berkeley, USA, June 2003."},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. International Workshop on Self-* Properties in Complex Information Systems","author":"Felber P.","year":"2004","unstructured":"P. Felber and E. W. Biersack . Self-scaling networks for content distribution . In Proc. International Workshop on Self-* Properties in Complex Information Systems , Bertinoro, Italy, May- June 2004 . P. Felber and E. W. Biersack. Self-scaling networks for content distribution. In Proc. International Workshop on Self-* Properties in Complex Information Systems, Bertinoro, Italy, May-June 2004."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2005.53"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498511"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863998"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251086.1251090"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24668-8_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080192.1080199"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2004.1378239"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028804"},{"key":"e_1_3_2_1_18_1","volume-title":"Proc. USENIX'05","author":"Kosti\u0107 D.","year":"2005","unstructured":"D. Kosti\u0107 , R. Braud , C. Killian , E. Vandekieft , J. W. Anderson , A. C. Snoeren , and A. Vahdat . Maintaining high bandwidth under dynamic network conditions . In Proc. USENIX'05 , Anaheim, CA, USA , April 2005 . D. Kosti\u0107, R. Braud, C. Killian, E. Vandekieft, J. W. Anderson, A. C. Snoeren, and A. Vahdat. Maintaining high bandwidth under dynamic network conditions. In Proc. USENIX'05, Anaheim, CA, USA, April 2005."},{"key":"e_1_3_2_1_20_1","unstructured":"A. Parker. The true picture of peer-to-peer filesharing. http:\/\/www.cachelogic.com\/ July 2004.  A. Parker. The true picture of peer-to-peer filesharing. http:\/\/www.cachelogic.com\/ July 2004."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11558989_19"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015508"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.801413"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_3_2_1_26_1","first-page":"1","volume-title":"Proc. IEEE Infocom'04","author":"Yang X.","year":"2004","unstructured":"X. Yang and G. de Veciana . Service capacity in peer-to-peer networks . In Proc. IEEE Infocom'04 , pages 1 -- 11 , Hong Kong, China , March 2004 . X. Yang and G. de Veciana. Service capacity in peer-to-peer networks. In Proc. IEEE Infocom'04, pages 1--11, Hong Kong, China, March 2004."}],"event":{"name":"IMC06: Internet Measurement Conference","location":"Rio de Janeriro Brazil","acronym":"IMC06","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 6th ACM SIGCOMM conference on Internet measurement"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1177080.1177106","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1177080.1177106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:39Z","timestamp":1750258299000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1177080.1177106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,25]]},"references-count":25,"alternative-id":["10.1145\/1177080.1177106","10.1145\/1177080"],"URL":"https:\/\/doi.org\/10.1145\/1177080.1177106","relation":{},"subject":[],"published":{"date-parts":[[2006,10,25]]},"assertion":[{"value":"2006-10-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}