Incentives for P2P-Assisted Content Distribution: If You Can't Beat 'Em, Join 'Em

被引:0
|
作者
Ramaswamy, Vinod [1 ]
Adlakha, Sachin [2 ]
Shakkottai, Srinivas [1 ]
Wierman, Adam [2 ]
机构
[1] Texas A&M Univ, Dept ECE, College Stn, TX 77843 USA
[2] CALTECH, Dept CS, Pasadena, CA USA
来源
2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON) | 2012年
关键词
DIFFUSION-MODEL;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The rapid growth of content distribution on the Internet has brought with it proportional increases in the costs of distributing content. Adding to distribution costs is the fact that digital content is easily duplicable, and hence can be shared in an illicit peer-to-peer (P2P) manner that generates no revenue for the content provider. In this paper, we study whether the content provider can recover lost revenue through a more innovative approach to distribution. In particular, we evaluate the benefits of a hybrid revenue-sharing system that combines a legitimate P2P swarm and a centralized client-server approach. We show how the revenue recovered by the content provider using a server-supported legitimate P2P swarm can exceed that of the monopolistic scheme by an order of magnitude. Our analytical results are obtained in a fluid model, and supported by stochastic simulations.
引用
收藏
页码:1409 / 1416
页数:8
相关论文
empty
未找到相关数据