13-09-2014, 03:54 PM
Secure Data Objects Replication in Data Grid
Secure Data O.pdf (Size: 2.07 MB / Downloads: 33)
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
2 OIRSP Specification
We define the first problem, OIRSP, as the optimal resident
set problem in a general graph (intercluster level graph)
with an MSC HMSC. Our goal is to determine the optimal
RC that yields minimum access cost at the cluster level.
For a cluster Hx 2 RC with jRxj l, all read request from
Hx are served locally and the cost is 0 at the cluster level.
For a cluster Hx with jRxj < l, it always transmits all read
access requests in Hx to the closest cluster Hy 2 RC to
access l distinct shares, with jRyj l. The read cost of
cluster at the cluster level is ArðHxÞjðHx; RCÞj. Let
ReadCostCðGC; RCÞ denote the total read cost in GC with
the resident set RC, then
CONCLUSION AND FUTURE RESEARCH
We have combined data partitioning schemes (secret sharing
scheme or erasure coding scheme) with dynamic replication