The multicast policy and its relationship to replicated data placement
ACM Transactions on Database Systems (TODS)
Providing high availability using lazy replication
ACM Transactions on Computer Systems (TOCS)
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)
Epidemic algorithms in replicated databases (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Communications of the ACM
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs
IEEE Transactions on Parallel and Distributed Systems
Extending the Kohonen self-organizing map networks for clustering analysis
Computational Statistics & Data Analysis
Information Survivability for Evolvable and Adaptable Real-Time Command and Control Systems
IEEE Transactions on Knowledge and Data Engineering
Placement of Read-Write Web Proxies in the Internet
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Theory and practice of verifiable secret sharing
Theory and practice of verifiable secret sharing
DARPA Information Assurance Program dynamic defense experiment summary
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Clustering of the self-organizing map
IEEE Transactions on Neural Networks
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
A QoS-Aware Heuristic Algorithm for Replica Placement
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
QoS-aware, access-efficient, and storage-efficient replica placement in grid environments
The Journal of Supercomputing
Adaptive checkpointing strategy to tolerate faults in economy based grid
The Journal of Supercomputing
Globe'11 Proceedings of the 4th international conference on Data management in grid and peer-to-peer systems
QoS-aware replica placement for grid computing
Concurrency and Computation: Practice & Experience
| Hi-index | 0.00 |
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changing the number of shares in secret sharing schemes can be costly. To achieve performance goals in data accesses, secret sharing can be combined with dynamic replication in a distributed system with varying client access patterns. In this paper, we investigate the problem of optimal allocation of secure data objects that are secret shared and possibly replicated. The system 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 nodes within each cluster also have a topology represented by a general graph. We decompose the share replica allocation problem into two sub-problems, the resident set problem which allocates a subset of shares to clusters, and the -intra-cluster allocation problem which determines the number of share replicas to be allocated and their placements. We develop two different heuristic algorithms for the two sub-problems. The algorithm for the optimal resident set problem has a time complexity of O(n^2 ). An O(n^3 ) algorithm is presented for the intra-cluster allocation problem.