A Security-aware Data Placement Mechanism for Big Data Cloud Storage Systems

被引:8
作者
Kang, Seungmin [1 ]
Veeravalli, Bharadwaj [1 ]
Aung, Khin Mi Mi [2 ]
机构
[1] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore, Singapore
[2] ASTAR, Data Storage Inst, Singapore, Singapore
来源
2016 IEEE 2ND INTERNATIONAL CONFERENCE ON BIG DATA SECURITY ON CLOUD (BIGDATASECURITY), IEEE INTERNATIONAL CONFERENCE ON HIGH PERFORMANCE AND SMART COMPUTING (HPSC), AND IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT DATA AND SECURITY (IDS) | 2016年
关键词
Security; data placement; cloud storage system; T-coloring; minimum retrieval time;
D O I
10.1109/BigDataSecurity-HPSC-IDS.2016.8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Public clouds have become an attractive candidate to meet the ever-growing storage demands. However, storing data in public clouds increases data retrieval time and threat level for data security. These challenges drive the need for intelligent methods that solve the data placement problem to achieve high performance while satisfying the security requirement. In this paper, we propose a novel approach for data placement in cloud storage systems addressing the above challenges. With the security constraint, we first formulate the data placement problem as a linear programming model that minimizes the total retrieval time of a data, which is divided and distributed over storage nodes. We then develop a heuristic algorithm namely Security-awarE Data placement mechanism for cLOUd storage Systems (SEDuLOUS) to solve the problem. We demonstrate the effectiveness of the proposed algorithm through comprehensive simulations. The simulation results show that the proposed algorithm significantly reduces the retrieval time by up to 20% for the random-network-topology systems and 19% for the Internet2-topology system compared to baseline methods, which consider only the security requirement.
引用
收藏
页码:327 / 332
页数:6
相关论文
共 14 条
[1]  
[Anonymous], 2008, 2008 IEEE INT S PARA
[2]  
[Anonymous], IEEE T COMPUT
[3]   APPROXIMATION ALGORITHMS FOR DATA PLACEMENT PROBLEMS [J].
Baev, Ivan ;
Rajaraman, Rajmohan ;
Swamy, Chaitanya .
SIAM JOURNAL ON COMPUTING, 2008, 38 (04) :1411-1429
[4]   Energy-efficient data replication in cloud computing datacenters [J].
Boru, Dejene ;
Kliazovich, Dzmitry ;
Granelli, Fabrizio ;
Bouvry, Pascal ;
Zomaya, Albert Y. .
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2015, 18 (01) :385-402
[5]  
Goldberg AV, 2005, PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P156
[6]   FREQUENCY ASSIGNMENT - THEORY AND APPLICATIONS [J].
HALE, WK .
PROCEEDINGS OF THE IEEE, 1980, 68 (12) :1497-1514
[7]   Privacy as a Service: Privacy-Aware Data Storage and Processing in Cloud Computing Architectures [J].
Itani, Wassim ;
Kayssi, Ayman ;
Chehab, Ali .
EIGHTH IEEE INTERNATIONAL CONFERENCE ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, PROCEEDINGS, 2009, :711-716
[8]  
Kang S, 2014, LECT NOTES COMPUT SC, V8508, P15, DOI 10.1007/978-3-662-43862-6_2
[9]   Data Replication in Data Intensive Scientific Applications with Performance Guarantee [J].
Nukarapu, Dharma Teja ;
Tang, Bin ;
Wang, Liqiang ;
Lu, Shiyong .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2011, 22 (08) :1299-1306
[10]  
Pardalos P.M., 1999, HDB COMBINATORIAL OP, P1077