CFS: a new dynamic replication strategy for data grids

Data grids are currently proposed solutions to large scale data management problems including efficient file transfer and replication. Large amounts of data and the world-wide distribution of data stores contribute to the complexity of the data management challenge. Recent architecture proposals and prototypes deal with dynamic replication strategies for a high-performance data grid. This paper describes a new dynamic replication strategy called Constrained Fast Spread (CFS). It aims to alleviate the main problems encountered in the current replication strategies like the negligence of the storage capacity of the nodes. The new CFS strategy enhanced the fast spread strategy by concentrating on the feasibility of replicating the requested replica on each node among the network.

[1]  Edward Chan,et al.  Cache invalidation scheme for mobile computing systems with real-time data , 2000, SGMD.

[2]  Xiong-Kai Shao,et al.  Maintain cache consistency of mobile database using dynamical periodical broadcast strategy , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[3]  Yousef Kilani,et al.  A threshold-based dynamic data replication strategy , 2010, The Journal of Supercomputing.

[4]  Ahmed K. Elmagarmid,et al.  Bit-Sequences: An adaptive cache invalidation method in mobile client/server environments , 1997, Mob. Networks Appl..

[5]  Hong Wang,et al.  An optimal construction of invalidation reports for mobile databases , 2001, CIKM '01.

[6]  Sandeep K. S. Gupta,et al.  A Strategy to Manage Cache Consistency in a Distributed Mobile Wireless Environment , 1998 .

[7]  Po-Jen Chuang,et al.  Constructing Efficient Cache Invalidation Schemes in Mobile Environments , 2007, 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System.

[8]  Margo I. Seltzer,et al.  The case for geographical push-caching , 1995, Proceedings 5th Workshop on Hot Topics in Operating Systems (HotOS-V).

[9]  Heonshik Shin,et al.  Enhanced Cost Effective Cache Invalidation for Mobile Clients in Stateless Server Environments , 2004, EUC.

[10]  Sooyong Park,et al.  A Cost Effective Cache Consistency Method for Mobile Clients in Wireless Environment , 2004, DASFAA.

[11]  Guohong Cao.  On Improving the Performance of Cache Invalidation in Mobile Environments , 2002, Mob. Networks Appl..

[12]  Reda Alhajj,et al.  An adaptive energy efficient cache invalidation scheme for mobile databases , 2006, SAC '06.

[13]  Tomasz Imielinski,et al.  Sleepers and workaholics: caching strategies in mobile environments , 1994, SIGMOD '94.

[14]  Li Fan,et al.  Summary cache: a scalable wide-area web cache sharing protocol , 2000, TNET.

[15]  Edward Chan,et al.  Concurrency control strategies for ordered data broadcast in mobile computing systems , 2004, Inf. Syst..

[16]  Jiannong Cao,et al.  Achieving Flexible Cache Consistency for Pervasive Internet Access , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom'07).