Beehive: low-cost content subscription service using cloudlets  

作　　者：XING YuanJian YANG Zhi CHEN Chi DAI YaFei 

机构地区：[1]Department of Computer Science, Peking University

出　　处：《Science China(Information Sciences)》2013年第7期190-205,共16页中国科学（信息科学）（英文版）

基　　金：supported by State Key Program of National Natural Science of China (Grant No. 61232004);National Basic Research Program of China (973 Program) (Grant No. 2011CB302305);National High-tech R&D Program of China (863 Program) (Grant No. 2013AA013203)

摘　　要：In recent years, Content Subscription Service （CSS） is showing a notable success in helping users fetch unpopular data in P2P networks. It works by maintaining a storage pool to pull the subscribed file and then redistribute them to the requestor. However, existing commercial CSS incurs huge bandwidth/equipment cost due to introducing a third-party cloud storage. We present Beehive, a low-cost yet efficient CSS, which leverages the idle node bandwidth/storage （i.e., cloudlets） in the original P2P system to form an inherent cloudlet storage. Since P2P nodes are geographically distributed, highly dynamic and heterogeneous, Beehive adopts three key techniques to achieve high performance. First, by applying random linear network coding, multiple seeders can upload the same file simultaneously without complicated wide-area coordination. Second, a model is developed to set the coding parameters so that the cloudlet storage achieves guaranteed performance in file availability and data distribution efficiency. Finally, by performing task outsourcing, overloaded seeders quickly offioad their tasks to idle peers, which effectively balances the load and utilizes the system resources. We implement Beehive with 29,000 lines of C＋＋ codes and deploy it in a real P2P file-sharing system. Results show that Beehive improves the success ratio of pulling peer-side files from 38.7% （traditional online download） to 84.3% （users offiine waiting for less than three days）, and provides users with over 200 kB/s download speed.In recent years, Content Subscription Service （CSS） is showing a notable success in helping users fetch unpopular data in P2P networks. It works by maintaining a storage pool to pull the subscribed file and then redistribute them to the requestor. However, existing commercial CSS incurs huge bandwidth/equipment cost due to introducing a third-party cloud storage. We present Beehive, a low-cost yet efficient CSS, which leverages the idle node bandwidth/storage （i.e., cloudlets） in the original P2P system to form an inherent cloudlet storage. Since P2P nodes are geographically distributed, highly dynamic and heterogeneous, Beehive adopts three key techniques to achieve high performance. First, by applying random linear network coding, multiple seeders can upload the same file simultaneously without complicated wide-area coordination. Second, a model is developed to set the coding parameters so that the cloudlet storage achieves guaranteed performance in file availability and data distribution efficiency. Finally, by performing task outsourcing, overloaded seeders quickly offioad their tasks to idle peers, which effectively balances the load and utilizes the system resources. We implement Beehive with 29,000 lines of C＋＋ codes and deploy it in a real P2P file-sharing system. Results show that Beehive improves the success ratio of pulling peer-side files from 38.7% （traditional online download） to 84.3% （users offiine waiting for less than three days）, and provides users with over 200 kB/s download speed.

关 键 词：content subscription service peer-to-peer LOW-COST cloudlet-based storage 

分 类 号：TP393.02[自动化与计算机技术—计算机应用技术]