Abstract | ||
---|---|---|
•A new modeling framework for cost estimation in the storage system is proposed for online social networks.•A novel scheme is proposed to solve the optimization problem by exploring joint placement and replication in a lightweight manner.•A dynamic algorithm is presented to handle OSN dynamics in practical environments.•Extensive experiments based on real world trace verify the superiority of our scheme over state-of-the-art schemes. |
Year | DOI | Venue |
---|---|---|
2018 | 10.1016/j.jocs.2017.08.001 | Journal of Computational Science |
Keywords | Field | DocType |
Online social networks,Cost optimization,Inter-data center traffic,Storage,Geo-distributed storage systems | Replica,Social graph,Social network,Computer data storage,Computer science,Latency (engineering),Distributed data store,Data center,Big data,Distributed computing | Journal |
Volume | ISSN | Citations |
26 | 1877-7503 | 2 |
PageRank | References | Authors |
0.37 | 22 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jing-Ya Zhou | 1 | 64 | 16.35 |
Jianxi Fan | 2 | 718 | 60.15 |
Juncheng Jia | 3 | 6 | 2.45 |
Baolei Cheng | 4 | 34 | 6.94 |
Zhao Liu | 5 | 25 | 10.73 |