{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:00:09Z","timestamp":1771704009429,"version":"3.50.1"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2006,1,10]],"date-time":"2006-01-10T00:00:00Z","timestamp":1136851200000},"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":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2006,1,10]]},"abstract":"<jats:p>A spirited panel was recently held at the 10th International Web Caching and Content Distribution workshop on the future of P2P in content distribution [1]. After more than ten years of content distribution research and technology efforts, P2P is emerging as an alternative solution to solve the mass distribution of large digital content. However, using P2P for commercial content distribution faces a number of serious challenges. Issues such as content protection, impact on ISPs, security, end-to-end connectivity, and business models need careful consideration before P2P an be used as an efficient tool by content providers. In this paper, we summarize the issues brought up in discussion, and delve deeper into the feasibility of commercial, legal P2P content distribution solutions<\/jats:p>","DOI":"10.1145\/1111322.1111339","type":"journal-article","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T18:14:10Z","timestamp":1139249650000},"page":"75-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["On the feasibility of commercial, legal P2P content distribution"],"prefix":"10.1145","volume":"36","author":[{"given":"Pablo","family":"Rodriguez","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, UK"}]},{"given":"See-Mong","family":"Tan","sequence":"additional","affiliation":[{"name":"Microsoft Corporation, Redmond, WA"}]},{"given":"Christos","family":"Gkantsidis","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, UK"}]}],"member":"320","published-online":{"date-parts":[[2006,1,10]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Web Caching and Content Distribution Workshop, http:\/\/2005","year":"2005"},{"key":"e_1_2_1_2_1","unstructured":"http:\/\/www.akamai.com\/  http:\/\/www.akamai.com\/"},{"key":"e_1_2_1_3_1","unstructured":"http:\/\/www.cachelogic.com\/  http:\/\/www.cachelogic.com\/"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"A.I.T. Rowstron and P. Druschel Pastry: Scalable decentralized object location and routing for large-scale peer-to-peer systems IFIP\/ACM 2001.   A.I.T. Rowstron and P. Druschel Pastry: Scalable decentralized object location and routing for large-scale peer-to-peer systems IFIP\/ACM 2001.","DOI":"10.1007\/3-540-45518-3_18"},{"key":"e_1_2_1_6_1","volume-title":"ACM USENIX IMC","author":"Karagiannis T.","year":"2005"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"M. Ammar \"Why Johnny Can't Multicast\" NOSSDAV Keynote June 2003.  M. Ammar \"Why Johnny Can't Multicast\" NOSSDAV Keynote June 2003.","DOI":"10.1145\/776322.776324"},{"key":"e_1_2_1_8_1","unstructured":"BBC iMP http:\/\/www.bbc.co.uk\/imp\/  BBC iMP http:\/\/www.bbc.co.uk\/imp\/"},{"key":"e_1_2_1_9_1","unstructured":"Open Media Network http:\/\/www.omn.org\/  Open Media Network http:\/\/www.omn.org\/"},{"key":"e_1_2_1_10_1","unstructured":"Christos Gkantsidis and Pablo Rodriguez \"Avalanche: Peer-Assisted Content Distribution\" http:\/\/www.research.microsoft.com\/~pablo\/avalanche.aspx  Christos Gkantsidis and Pablo Rodriguez \"Avalanche: Peer-Assisted Content Distribution\" http:\/\/www.research.microsoft.com\/~pablo\/avalanche.aspx"},{"key":"e_1_2_1_11_1","unstructured":"Gorkster Case http:\/\/www.eff.org\/IP\/P2P\/MGM_v_Grokster\/  Gorkster Case http:\/\/www.eff.org\/IP\/P2P\/MGM_v_Grokster\/"},{"key":"e_1_2_1_12_1","unstructured":"http:\/\/forum.emule-project.net\/index.php? showtopic=14768  http:\/\/forum.emule-project.net\/index.php? showtopic=14768"},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"S. Guha and P. Francis \"Chara terization and Measurement of TCP Traversal through NATs and Firewalls\" ACM USENIX IMC Berkeley 2005.   S. Guha and P. Francis \"Chara terization and Measurement of TCP Traversal through NATs and Firewalls\" ACM USENIX IMC Berkeley 2005.","DOI":"10.1145\/1330107.1330131"},{"key":"e_1_2_1_14_1","unstructured":"http:\/\/www.sandvine.com\/  http:\/\/www.sandvine.com\/"},{"key":"e_1_2_1_15_1","unstructured":"http:\/\/www.cs.cmu.edu\/~esm\/  http:\/\/www.cs.cmu.edu\/~esm\/"},{"key":"e_1_2_1_16_1","unstructured":"http:\/\/www.coolstreaming.it\/  http:\/\/www.coolstreaming.it\/"},{"key":"e_1_2_1_17_1","unstructured":"Recording Industry Association of America 2005 http:\/\/www.digitalmusicnews.com\/data\/100305first_half_riaa.pdf  Recording Industry Association of America 2005 http:\/\/www.digitalmusicnews.com\/data\/100305first_half_riaa.pdf"},{"key":"e_1_2_1_18_1","unstructured":"Big Champagne \"P2P Usage Volumes\" August 2005. http:\/\/www.bigchampagne.com\/  Big Champagne \"P2P Usage Volumes\" August 2005. http:\/\/www.bigchampagne.com\/"},{"key":"e_1_2_1_19_1","unstructured":"Can Netflix's Reed Hastings succeed in the battle to deliver movies online \"The Economist\" July 7th 2005.  Can Netflix's Reed Hastings succeed in the battle to deliver movies online \"The Economist\" July 7th 2005."}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111322.1111339","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1111322.1111339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:08:39Z","timestamp":1750262919000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1111322.1111339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1,10]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,1,10]]}},"alternative-id":["10.1145\/1111322.1111339"],"URL":"https:\/\/doi.org\/10.1145\/1111322.1111339","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2006,1,10]]},"assertion":[{"value":"2006-01-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}