Document Type : Special Issue
Authors
1
Department of Computer Engineering, Birjand University of Technology, Birjand, Iran
2
Department of Computer and Technology, Birjand University of Medical Sciences, Birjand, Iran
3
Department of Computer Engineering, University of Torbat Heydarieh, Torbat Heydarieh, Iran
Abstract
In different scientific disciplines, large-scale data are generated with enormous storage requirements. Therefore, effective data management is a critical issue in distributed systems such as the cloud. As tasks can access a nearby site to access the required file, replicating the desired file to an appropriate location improves access time and reliability. Replicating the popular file to an appropriate site is a good choice, as tasks can get the necessary file from a nearby site. In this research, a novel data replication algorithm is proposed that is consisted of four main phases: 1- determining 20% of commonly used files, 2- computing five conflicting objectives (i.e., average service time, load variance, energy consumption, average response time and cost) 3- finding the near-optimal solution (i.e., suitable locations for new replica) by the PSO technique to acquire a trade-off among the desired objectives. 4- replica replacement considering a fuzzy system with three inputs (i.e., Number of accesses, size of replica and the last access time). The experimental results denote that the proposed replication algorithm outperforms the Profit oriented Data Replication (PDR) and Bee colony-based approach for Data Replication (BCDR) strategies in terms of energy consumption, average response time, load variance, number of connections, Hit ratio, Storage usage, and cost.
Keywords
Main Subjects
Send comment about this article