Enhanced Fast Spread Replication strategy for Data Grid
Journal of Network and Computer Applications
Replication techniques in data grid environments
ACIIDS'12 Proceedings of the 4th Asian conference on Intelligent Information and Database Systems - Volume Part II
A threshold-based dynamic data replication strategy
The Journal of Supercomputing
A cloud architecture with an efficient scheduling technique
ICICA'12 Proceedings of the Third international conference on Information Computing and Applications
Cloud Computing: Locally Sub-Clouds instead of Globally One Cloud
International Journal of Cloud Applications and Computing
Replica creation strategy based on quantum evolutionary algorithm in data gird
Knowledge-Based Systems
| Hi-index | 0.00 |
Data grid is a very important and useful technique to process the large number of data produced by scientific experiments and simulations. However, the high latency of the Internet turns to be the bottleneck in accessing the files in the grid. The replication strategy can shorten the time of getting the files by creating many replicas and storing the replicas in appropriate locations. Restricted by the storage capacity, it is important to design an effective algorithm for the replication replacement task. In this paper, we propose a novel replacement strategy which calculates the weight of replicas based on the access times in the future time window, the access bandwidth and the file size. Results from the simulation procedure show the better performance of our algorithm than former ones.