Name
Title | ||
|---|---|---|
Cost-Effective and Traffic-Optimal Data Placement Strategy for Cloud-based Online Social Networks |
Abstract | ||
|---|---|---|
Cloud-based Online Social Networks (OSNs) make it easier for geographically dispersed users to communicate with each other. These users not only demand to quickly access their own data but also hope to access their friends' data with low latency. In order to solve the problem, it is necessary to design a replica placement strategy to manage data on large-scale social networks and reduce the data storage costs while meeting the access latency requirement. In this paper, we propose a novel genetic algorithm-based data placement strategy to find an optimal number of replicas for each user's data and their optimal location. The method can reduce the inter-server traffic load across servers and ensure that users can access data in a tolerable time. Experiments with real Facebook dataset demonstrate that our data placement strategy can significantly reduce the cost of data storage and inter-server traffic. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/CSCWD.2018.8465343 | 2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design ((CSCWD)) |
Keywords | Field | DocType |
Social network,Data placement,Access latency,Inter-server traffic,Genetic algorithm | Resource management,Replica,Computer science,Latency (engineering),Computer data storage,Server,Latency (engineering),Genetic algorithm,Distributed computing,Cloud computing | Conference |
ISBN | Citations | PageRank |
978-1-5386-1483-9 | 0 | 0.34 |
References | Authors | |
8 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| lei zhang | 1 | 403 | 143.70 |
| Xuejun Li | 2 | 34 | 13.95 |
| Hourieh Khalajzadeh | 3 | 13 | 6.05 |
| Yan Yang | 4 | 121 | 22.47 |
| Ruiyue Zhu | 5 | 0 | 0.34 |
| Xia Ji | 6 | 0 | 1.01 |
| Chuanhui Ju | 7 | 0 | 0.34 |
| Yun Yang | 8 | 2103 | 150.49 |