Optimal Replication Node Assignment in File Versioning Protocol to Assure Low Access Costs for Read Clients
Data replication is one of the most effective scheme for maintaining the high reliability and performance of data storage systems. This paper examines the optimization problem in a distributed data replication protocol with file versioning. An analytical model is presented to estimate the optimal node assignment to assure the required average cost saving for read access with minimum number of total replication nodes. Since this resource allocation problem is a kind of nonlinear integer problem, it can sometimes needs tremendous computational costs when the system has enormous storage nodes. We introduce a continuous relaxed problem corresponding to the above integer problem. The optimal node assignment is analytically derived by solving the problem without computational searching. We further show the numerical examples for the results obtained by our analysis.
data replication file versioning optimal node assignment
SATOSHI FUKUMOTO MAMORU OHARA MITSUHIRO KIMURA
Information and Communications Systems, Faculty of System Design, Tokyo Metropolitan University, 6-6 Department of Industrial and Systems Engineering, Faculty of Science and Engineering, Hosei Universi
国际会议
北京
英文
344-350
2011-06-20（万方平台首次上网日期，不代表论文的发表时间）