On incentivizing upload capacity in P2P-VoD systems: Design, analysis and evaluation
Publication in refereed journal


摘要Free riding has long been a serious problem in peer-to-peer (P2P) systems due to the selfish behavior of individual users. To conquer this problem, a key design issue of the P2P systems is to appropriately incentivize users to contribute resources. In P2P Video-on-Demand (VoD) applications, content providers need to incentivize the peers to dedicate bandwidth and upload data to one other so as to alleviate the upload workload of their content servers. In this paper, we design a simple yet practical incentive mechanism that rewards each peer based on its dedicated upload bandwidth. We use a mean field interaction model to characterize the distribution of number of peers in different video segments, based on which we characterize the content providers' uploading cost as a function of the peers' contribution. By using a game theoretic framework, we analyze the interaction between a content provider's rewarding strategy and the peers' contributing behaviors and derive a unique Stackelberg equilibrium. We further analyze the system efficiency in terms of the price of anarchy and study the long term behavior of the system under a repeated game setting. Via extensive simulations, we validate the stability and efficiency of our incentive scheme. (C) 2013 Elsevier B.V. All rights reserved.
著者Wu WJ, Lui JCS, Ma RTB
期刊名稱Computer Networks
詳細描述 Journal of Computer Networks is considered a top-tier journal by the external visiting committee in the Faculty of Engineering \n\nTo ORKTS: <
頁次1674 - 1688
關鍵詞Incentive; Mean-field; P2P-VoD; Stackelberg game
Web of Science 學科類別Computer Science; Computer Science, Hardware & Architecture; COMPUTER SCIENCE, HARDWARE & ARCHITECTURE; Computer Science, Information Systems; COMPUTER SCIENCE, INFORMATION SYSTEMS; Engineering; Engineering, Electrical & Electronic; ENGINEERING, ELECTRICAL & ELECTRONIC; Telecommunications; TELECOMMUNICATIONS

上次更新時間 2020-30-11 於 23:39