Competitive algorithms for distributed data management (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
An Efficient Scheme for Dynamic Data Replication
An Efficient Scheme for Dynamic Data Replication
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Hi-index | 0.00 |
This paper presents a novel decentralized dynamic replication management mechanism based on accessing frequency detecting (FDRM).In FDRM, in order to provide better system performance and reduce network traffic, system node scans the local replica of a certain file to detect its access pattern, and makes decision independently to add, delete or migrate a replica for that file. In addition, the scanning interval of a replica is variable according to the accessing frequency to that replica, which makes FDRM more sensitive to the change of system behavior, and we can get better performance with less system overhead. In the end, the paper evaluates the efficiency of FSRM by experimental result and shows the performance enhancement.