Contracting Models for P2P Content Distribution

被引:10
|
作者
Ghasemkhani, Hossein [1 ]
Li, Yung-Ming [2 ]
Moinzadeh, Kamran [3 ]
Tan, Yong [3 ,4 ]
机构
[1] Purdue Univ, Krannert Sch Management, W Lafayette, IN 47907 USA
[2] Natl Chiao Tung Univ, Coll Management, Hsinchu 300, Taiwan
[3] Univ Washington, Michael G Foster Sch Business, Seattle, WA 98195 USA
[4] Tsinghua Univ, Sch Econ & Management, Beijing, Peoples R China
基金
美国国家科学基金会;
关键词
P2P networks; content distribution; moral hazard; principal-agent model; TO-PEER NETWORKS; TOURNAMENTS; INFORMATION; COMPETITION; FRAMEWORK; MECHANISM; RESOURCE; SYSTEMS;
D O I
10.1111/poms.12718
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In recent years, peer-to-peer (P2P) networks have become an increasingly popular method for distributing digital content. In this study, we consider the development of optimal contracts for a P2P network by a profit-seeking provider to support the operations of an online file exchange service. By utilizing the principal-agent model of incentive theory, we propose appropriate reward and pricing schemes for profit-seeking P2P content distribution networks. We show that when peers are homogeneous, upload compensation increases with propagation delay uncertainty, maximum uploading nodes allowed, peers' provision cost and disutility of download delay, but decreases with the network size and content availability. We also characterize a general contracting model where there are a countable number of peer classes which are heterogeneous in their provisioning costs. For the case of two peer classes where optimal delays are separable, we derive the optimal upload compensations under different scenarios and show that the impact of operational parameters is quite similar to the case of homogeneous peers, lending support to the robustness of our analysis.
引用
收藏
页码:1940 / 1959
页数:20
相关论文
共 50 条
  • [21] Business models for music distribution after the P2P revolution
    Dubosson-Torbay, M
    Pigneur, Y
    Usunier, JC
    PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON WEB DELIVERING OF MUSIC, 2004, : 172 - 179
  • [22] On the Market Power of Network Coding in P2P Content Distribution Systems
    Zhang, Xinyu
    Li, Baochun
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (12) : 2063 - 2070
  • [23] P2P VoD Content Distribution Strategy based on Gradient Model
    Dai Xiuyue
    Wang Qun
    Tang Yifang
    MANUFACTURING PROCESS AND EQUIPMENT, PTS 1-4, 2013, 694-697 : 2265 - 2269
  • [24] Interaction Patterns between P2P Content Distribution Systems and ISPs
    Dan, Gyoergy
    Hossfeld, Tobias
    Oechsner, Simon
    Cholda, Piotr
    Stankiewicz, Rafal
    Papafili, Ioanna
    Stamoulis, George D.
    IEEE COMMUNICATIONS MAGAZINE, 2011, 49 (05) : 222 - 230
  • [25] Implementation and Simulation of Content Distribution Strategy in P2P VOD System
    Zhang, Jing
    2011 3RD INTERNATIONAL CONFERENCE ON ENVIRONMENTAL SCIENCE AND INFORMATION APPLICATION TECHNOLOGY ESIAT 2011, VOL 10, PT B, 2011, 10 : 1315 - 1320
  • [26] On the Market Power of Network Coding in P2P Content Distribution Systems
    Zhang, Xinyu
    Li, Baochun
    IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 334 - 342
  • [27] A novel optimal data scheduling approach to P2P content distribution
    Ji, Qi-Jin
    Shanghai Jiaotong Daxue Xuebao/Journal of Shanghai Jiaotong University, 2010, 44 (03): : 403 - 406
  • [28] A COALITION BASED INCENTIVE MECHANISM FOR P2P CONTENT DISTRIBUTION SYSTEMS
    Belmonte, M. V.
    Diaz, M.
    Reyna, A.
    ICAART 2011: PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 2, 2011, : 15 - 24
  • [29] Improving the Performance of P2P Content Distribution Systems by Choosing Proper Content Providers
    Wan, Yi
    Asaka, Takuya
    Takahashi, Tatsuro
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2009, E92B (07) : 2500 - 2502
  • [30] Using P2P techniques for Content Distribution Internetworking: A research proposal
    Turrini, E
    Panzieri, F
    SECOND INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS, 2002, : 171 - 172