Replica placement using genetic algorithm

Replica placement is one of the classic issues, which enjoys applicability in finding the optimal location to deploy servers in different fields, particularly, industry in addition to computer network fields. Several methods have been proposed for selecting such locations optimally. The two noteworthy parameters such methods try to optimize are: selection of the best-fit location and the time of executing the algorithm. Consequently, the efficient method will be the one that selects locations as close to the optimal status as possible and enjoys a rather acceptable speed. This is considered an NP-Complete problem, and thus, heuristic methods will be used in its solution. Among the proposed methods to solve the problem of replica placement of server location, the best algorithm in terms of time complexity is the O (N. max(logN, K)). The method which has been introduced in this study is the designation and implementation of an algorithm using the genetic algorithm. The execution time of such an algorithm is much less than the algorithms whose location is close to optimal.