Beehive： low-cost content subscription service using cloudlets

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 bandwid...

Full description

Saved in:
Bibliographic Details
Published in:Science China. Information sciences 2013-07, Vol.56 (7), p.190-205
Main Authors: Xing, YuanJian, Yang, Zhi, Chen, Chi, Dai, YaFei
Format: Article
Language:English
Subjects:
Bandwidth
Bandwidths
Cloud computing
Coding
Computer Science
Downloading
Dynamics
Equipment costs
Geographical distribution
Information Systems and Communication Service
Low cost
Networks
P2P网络
Research Paper
Seeders
Subscriptions
Tasks
下载速度
低成本
存储性能
文件共享系统
服务
蜂巢
订阅
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1674-733X
1869-1919
DOI:10.1007/s11432-013-4890-x