Secure Data Objects Replication in Data Grid
- 10 June 2008
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 7 (1), 50-64
- https://doi.org/10.1109/tdsc.2008.19
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.Keywords
This publication has 19 references indexed in Scilit:
- Responsive security for stored dataIEEE Transactions on Parallel and Distributed Systems, 2003
- Enabling Peer-to-Peer Interactions for Scientific Applications on the GridLecture Notes in Computer Science, 2003
- Optimal placement of replicas in trees with read, write, and storage costsIEEE Transactions on Parallel and Distributed Systems, 2001
- Distributed Database Management Systems and the Data Grid2001 Eighteenth IEEE Symposium on Mass Storage Systems and Technologies, 2001
- OceanStorePublished by Association for Computing Machinery (ACM) ,2000
- Information survivability for evolvable and adaptable real-time command and control systemsIEEE Transactions on Knowledge and Data Engineering, 1999
- An adaptive data replication algorithmACM Transactions on Database Systems, 1997
- The dangers of replication and a solutionACM SIGMOD Record, 1996
- Distributed fingerprints and secure information dispersalPublished by Association for Computing Machinery (ACM) ,1993
- The multicast policy and its relationship to replicated data placementACM Transactions on Database Systems, 1991