Binary-Tree Based Estimation of File Requests for Efficient Data Replication
Authors:
- 9 January 2017
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 28 (7) , 1839-1852
Abstract
Recently, data replication has received considerable attention in the field of grid computing. The main goal of data replication algorithms is to optimize data access performance by replicating the most popular files. When a file does not exist in the node where it was requested, it necessarily has to be transferred from another node, causing delays in the completion the file requests. The general idea behind data replication is to keep track of the most popular files requested in the grid and create copies of them in selected nodes. In this way, more file requests can be completed over a period of time and average job execution time is reduced. In this paper, we introduce an algorithm that estimates the potential of the files located in each node of the grid, using a binary tree structure. Also, the file scope and the file type are taken into account. By potential of a file, we mean its increasing or decreasing demand over a period of time. The file scope generally refers to the extent of the group of users which are interested or potentially interested in a file. The file types are divided into read and write intensive. Our scheme mainly promotes the high-potential files for replication, based on the temporal locality principle. The simulation results indicate that the proposed scheme can offer better data access performance in terms of the hit ratio and the average job execution time, compared to other state-of-the-art strategies.Keywords
This publication has 22 references indexed in Scilit:
- Selective Data Replication for Online Social Networks with Distributed DatacentersIEEE Transactions on Parallel and Distributed Systems, 2015
- A Round-based Data Replication StrategyIEEE Transactions on Parallel and Distributed Systems, 2015
- PFRF: An adaptive data replication algorithm based on star-topology data gridsFuture Generation Computer Systems, 2012
- A dynamic replica management strategy in data gridJournal of Network and Computer Applications, 2012
- A novel dynamic network data replication scheme based on historical access record and proactive deletionThe Journal of Supercomputing, 2011
- PHFS: A dynamic replication method, to decrease access latency in the multi-tier data gridFuture Generation Computer Systems, 2011
- Dynamic replication in a data grid using a Modified BHR Region Based AlgorithmFuture Generation Computer Systems, 2011
- Adaptive popularity-driven replica placement in hierarchical data gridsThe Journal of Supercomputing, 2009
- Optimal replica placement in hierarchical Data Grids with locality assuranceJournal of Parallel and Distributed Computing, 2008
- Dynamic Data Grid Replication Strategy Based on Internet HierarchyLecture Notes in Computer Science, 2004