Please use this identifier to cite or link to this item:
|Title:||On incentivizing caching for P2P-VoD systems||Authors:||Wu, W.
|Issue Date:||2012||Citation:||Wu, W.,Ma, R.T.B.,Lui, J.C.S. (2012). On incentivizing caching for P2P-VoD systems. Proceedings - IEEE INFOCOM : 164-169. ScholarBank@NUS Repository. https://doi.org/10.1109/INFCOMW.2012.6193481||Abstract:||Peer-to-peer (P2P) systems consist of selfish peers which would like to receive services from others but would not like to contribute their own resources by default. To conquer this problem, proper incentive schemes are needed so as to stimulate the peers' contributions. This issue is particularly important for P2P Video-on-Demand (VoD) services. Content providers of P2P-VoD services want to incentivize peers to cache video data so that the peers can transfer data to one another and alleviate the workload of the content server. In this paper, we design a practical mechanism under which the peers are rewarded based on the popularity of the video they cache. We characterize the impact of this incentive scheme on peers' caching behaviors. In particular, we formulate an optimization framework to decide the optimal reward price for each video so as to keep enough replicas and minimize the content provider's operational cost. Via extensive simulations, we validate the effectiveness and efficiency of our incentive scheme. © 2012 IEEE.||Source Title:||Proceedings - IEEE INFOCOM||URI:||http://scholarbank.nus.edu.sg/handle/10635/41559||ISBN:||9781467310178||ISSN:||0743166X||DOI:||10.1109/INFCOMW.2012.6193481|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 26, 2021
checked on Dec 2, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.