Improving Cloud-based Online Social Network Data Placement and Replication

被引:0
作者
Khalajzadeh, Hourieh [1 ]
Yuan, Dong [2 ]
Grundy, John [3 ]
Yang, Yun [1 ]
机构
[1] Swinburne Univ Technol, Sch Software & Elect Engn, Melbourne, Vic, Australia
[2] Univ Sydney, Sch Elect & Informat Engn, Sydney, NSW, Australia
[3] Deakin Univ, Sch Informat Technol, Melbourne, Vic, Australia
来源
PROCEEDINGS OF 2016 IEEE 9TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (CLOUD) | 2016年
基金
澳大利亚研究理事会;
关键词
Online Social Network; Data Placement; Data Replication; Latency; Genetic Algorithm;
D O I
10.1109/CLOUD.2016.93
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Online social networks make it more convenient for people to find and communicate with other people based on shared interests, ideas, association with different groups, etc. Common social networks such as Facebook and Twitter have hundreds of millions or even billions of users scattered all around the world sharing interconnected data. Users demand low latency access to not only their own data but also their friends' data, often very large, e.g. videos, pictures etc. However, social network service providers have a limited monetary capital to store every piece of data everywhere to minimise users' data access latency. Geo-distributed cloud services with virtually unlimited capabilities are suitable for large scale social networks data storage in different geographical locations. Key problems including how to optimally store and replicate these huge datasets and how to distribute the requests to different datacenters are addressed in this paper. A novel genetic algorithm-based approach is used to find a near-optimal number of replicas for every user's data and a near-optimal placement of replicas to minimise monetary cost while satisfying latency requirements for all users. Experiments on a Facebook dataset demonstrate our technique's effectiveness in outperforming other representative placement and replication strategies.
引用
收藏
页码:678 / 685
页数:8
相关论文
共 25 条
[1]  
[Anonymous], 2001, An Introduction to Genetic Algorithms. Complex Adaptive Systems
[2]  
[Anonymous], 2010, P IEEE C EV COMP BAR, DOI DOI 10.1109/CEC.2010.5586151
[3]  
[Anonymous], 2012, LEARNING DISCOVER SO
[4]  
Ardekani M.S., 2014, OSDI 14
[5]  
Constine J., 2012, How Big Is Facebook's Data? 2.5 Billion Pieces Of Content And 500+ Terabytes Ingested Every Day
[6]   A Data Placement Strategy Based on Genetic Algorithm in Cloud Computing Platform [J].
Guo, Wei ;
Wang, Xinjun .
2013 10TH WEB INFORMATION SYSTEM AND APPLICATION CONFERENCE (WISA 2013), 2013, :369-372
[7]  
Jain Navendu, 2010, 7 USENIX S NETW SYST
[8]  
Jiao L, 2014, IEEE INFOCOM SER, P28, DOI 10.1109/INFOCOM.2014.6847921
[9]  
Jiao Lei., 2014, IEEE ACM T NETWORKIN, V24, P99
[10]  
Kadambi S, 2011, PROC VLDB ENDOW, V4, P1040