Fan, WenguangArasteh, BahmanBouyer, AsgaraliMajidnezhad, Vahid2024-05-192024-05-1920230920-85421573-0484https://doi.org10.1007/s11227-023-05401-1https://hdl.handle.net/20.500.12713/5035One of the main problems of big distributed systems, like IoT, is the high access time to data objects. Replicating the data objects on various servers is a traditional strategy. Replica placement, which can be implemented statically or dynamically, is generally crucial to the effectiveness of distributed systems. Producing the minimum number of data copies and placing them on appropriate servers to minimize access time is an NP-complete optimization problem. Various heuristic techniques for efficient replica placement in distributed systems have been proposed. The main objectives of this research are to decrease the cost of data processing operations, decrease the number of copies, and improve the accessibility of the data objects. In this study, a discretized and group-based gray wolf optimization algorithm with swarm and evolutionary features was developed for the replica placement problem. The proposed algorithm includes swarm and evolutionary features and divides the wolves' population into subgroups, and each subgroup was locally searched in a different solution space. According to experiments conducted on the standard benchmark dataset, the suggested method provides about a 40% reduction in the data access time with about five replicas. Also, the reliability of the suggested method during different executions is considerably higher than the previous methods.eninfo:eu-repo/semantics/closedAccessDistributed SystemsData Access TimeReplica PlacementGroup-Based Gray Wolf OptimizationStabilityNumber Of ReplicasArticle79171939619430WOS:0009957787000052-s2.0-85160403438N/A10.1007/s11227-023-05401-1Q2