Replica Placement Design with Static Optimality and Dynamic Maintainability

Authors:
Rashedur M. Rahman;Ken Barker;Reda Alhajj
Affiliations:
Univesity of Calgary, Canada;Univeristy of Calgary, Canada;Global Universityy, Lebanon
Venue:
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
Year:
2006

Citing 0
Cited 11

Performance of file replication policies for real-time file access in data grids

Proceedings of the first international conference on Networks for grid applications
Replica selection strategies in data grid

Journal of Parallel and Distributed Computing
Performance evaluation of different replica placement algorithms

International Journal of Grid and Utility Computing
A study on performance of dynamic file replication algorithms for real-time file access in Data Grids

Future Generation Computer Systems
Branch replication scheme: A new model for data replication in large scale data grids

Future Generation Computer Systems
File replication, maintenance, and consistency management services in data grids

The Journal of Supercomputing
A dynamic file maintenance scheme with Bayesian network for data grids

MTPP'10 Proceedings of the Second Russia-Taiwan conference on Methods and tools of parallel programming multicomputers
QoS enhancements for global replication management in peer to peer networks

Future Generation Computer Systems
A Decentralized Periodic Replication Strategy Based on Knapsack Problem

GRID '12 Proceedings of the 2012 ACM/IEEE 13th International Conference on Grid Computing
Replica creation strategy based on quantum evolutionary algorithm in data gird

Knowledge-Based Systems
MORM: A Multi-objective Optimized Replication Management strategy for cloud storage cluster

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a static replica placement algorithm that places replicas to sites by optimizing average response time and a dynamic replica maintenance algorithm that re-allocates replicas to new candidate sites if a performance metric degrades significantly over last K time periods. Simulation results demonstrate that the dynamic maintenance algorithm with static placement decisions performs best in dynamic environments like Data Grids.