Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
Distributed fingerprints and secure information dispersal
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
End-to-end routing behavior in the Internet
IEEE/ACM Transactions on Networking (TON)
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
Communications of the ACM
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs
IEEE Transactions on Parallel and Distributed Systems
The costs and limits of availability for replicated services
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Data management and transfer in high-performance computational grid environments
Parallel Computing - Parallel data-intensive algorithms and applications
Information Survivability for Evolvable and Adaptable Real-Time Command and Control Systems
IEEE Transactions on Knowledge and Data Engineering
Identifying Dynamic Replication Strategies for a High-Performance Data Grid
GRID '01 Proceedings of the Second International Workshop on Grid Computing
On Availability QoS for Replicated Multimedia Service and Content
IDMS/PROMS 2002 Proceedings of the Joint International Workshops on Interactive Distributed Multimedia Systems and Protocols for Multimedia Systems: Protocols and Systems for Interactive Distributed Multimedia
Fine-Grain Access Control for Securing Shared Resources in Computational Grids
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Erasure Coding Vs. Replication: A Quantitative Comparison
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
Simulation of Dynamic Data Replication Strategies in Data Grids
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Stork: Making Data Placement a First Class Citizen in the Grid
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
A method for transparent admission control and request scheduling in e-commerce web sites
Proceedings of the 13th international conference on World Wide Web
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Model-Based Evaluation: From Dependability to Security
IEEE Transactions on Dependable and Secure Computing
IEEE Internet Computing
A Metadata Catalog Service for Data Intensive Applications
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
On the Optimal Placement of Secure Data Objects over Internet
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Using Erasure Codes Efficiently for Storage in a Distributed System
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
Evolutionary Computation
Foundations Of Instrusion Tolerant Systems Oasis
Foundations Of Instrusion Tolerant Systems Oasis
End-to-end WAN service availability
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Design and analysis of a load balancing strategy in data grids
Future Generation Computer Systems - Special section: Data mining in grid computing environments
Secure Data Objects Replication in Data Grid
IEEE Transactions on Dependable and Secure Computing
Quality of availability: replica placement for widely distributed systems
IWQoS'03 Proceedings of the 11th international conference on Quality of service
A framework for evaluating storage system security
FAST'02 Proceedings of the 1st USENIX conference on File and storage technologies
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Responsive security for stored data
IEEE Transactions on Parallel and Distributed Systems
Secure dynamic fragment and replica allocation in large-scale distributed file systems
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
Data dependability is an important issue in data Grids. Replication schemes have been widely used in distributed systems to ensure availability and improve access performance. Alternatively, data partitioning schemes (secret sharing, erasure coding with encryption) can be used to provide availability and, in addition, to offer confidentiality protection. In peer-to-peer data Grids, such confidentiality protection is essential since the nodes hosting the data shares may not be trustworthy or may be compromised. However, difficulties in generating new shares and potential security concerns for share reallocation make a pure data partitioning scheme not easily adaptable to dynamic user access patterns. In this paper, we consider combining replication and data partitioning to assure data availability, confidentiality, load balance, and efficient access for data Grid applications. Data are partitioned and shares are dispersed. The shares may be replicated to achieve better performance, load balance, and availability. Models for assessing confidentiality, availability, load balance, and communication cost are developed and used as the metrics to guide placement decisions. Due to the nature of contradicting goals, we model the placement decision problem as a multi-objective problem and use a genetic algorithm to determine solutions that are approximate to the Pareto optimal placement solutions.