Secure Data Objects Replication in Data Grid

Authors:
Manghui Tu;Peng Li;I-Ling Yen;Bhavani M. Thuraisingham;Latifur Khan
Affiliations:
UT Dallas, Richardson;UT Dallas, Richardson;UT Dallas, Richardson;UT Dallas, Richardson;UT Dallas, Richardson
Venue:
IEEE Transactions on Dependable and Secure Computing
Year:
2010

Citing 0
Cited 8

Replication techniques in data grid environments

ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
Data security services, solutions and standards for outsourcing

Computer Standards & Interfaces
A Publicly Verifiable Dynamic Secret Sharing Protocol for Secure and Dependable Data Storage in Cloud Computing

International Journal of Cloud Applications and Computing
Data Placement in P2P Data Grids Considering the Availability, Security, Access Performance and Load Balancing

Journal of Grid Computing
A content aware and name based routing network speed up system

ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World
Modelling and evaluating a high serviceability fault tolerance strategy in cloud computing environments

International Journal of Security and Networks
Dynamic replica placement and selection strategies in data grids- A comprehensive survey

Journal of Parallel and Distributed Computing
Analyzing, modeling and evaluating dynamic adaptive fault tolerance strategies in cloud computing environments

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical information. To achieve performance goals in data accesses, these data fragmentation approaches can be combined with dynamic replication. In this paper, we consider data partitioning (both secret sharing and erasure coding) and dynamic replication in data grids, in which security and data access performance are critical issues. More specifically, we investigate the problem of optimal allocation of sensitive data objects that are partitioned by using secret sharing scheme or erasure coding scheme and/or replicated. The grid topology we consider consists of two layers. In the upper layer, multiple clusters form a network topology that can be represented by a general graph. The topology within each cluster is represented by a tree graph. We decompose the share replica allocation problem into two subproblems: the Optimal Intercluster Resident Set Problem (OIRSP) that determines which clusters need share replicas and the Optimal Intracluster Share Allocation Problem (OISAP) that determines the number of share replicas needed in a cluster and their placements. We develop two heuristic algorithms for the two subproblems. Experimental studies show that the heuristic algorithms achieve good performance in reducing communication cost and are close to optimal solutions.