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
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Self-organizing maps
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Database Location in Computer Networks
Journal of the ACM (JACM)
An algorithm for finding a K-median in a directed tree
Information Processing Letters - Special issue analytical theory of fuzzy control with applications
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
Extending the Kohonen self-organizing map networks for clustering analysis
Computational Statistics & Data Analysis
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
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
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
Adaptive Replication in Peer-to-Peer Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Optimal replica placement on transparent replication proxies for read/write data
PCC '02 Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International
A data management framework for secure and dependable data grid
A data management framework for secure and dependable data grid
Symmetric replication for structured peer-to-peer systems
DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
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
| Hi-index | 0.01 |
Secret sharing and erasure coding based approaches have been used in distributed storage systems to ensure confidentiality, integrity, and availability of critical information. However, these approaches introduce some access overhead since each access now needs to access multiple data sites to retrieve the original data. In this paper, we investigate allocation of data partitions in the network for data objects that are partitioned by using secret sharing schemes or erasure coding schemes. We define the problem as finding M nodes in the network to host the data partitions so that the total communication cost (the sum of the read communication cost and write communication cost in terms of communication distance) is minimized to read K partitions and update M partitions by all nodes in the network. This problem is NP-hard. We propose a self-organizing feature map (SOFM)-like algorithm and a heuristic algorithm for this problem. The numerical study shows both algorithms are effective for this problem.