Bahman Arasteh, Asgarali Bouyer, Reza Ghanbarzadeh, Alireza Rouhi, Mahsa Nazeri Mehrabani, Erfan Babaee Tirkolaee

DOI Number
First page
Last page


Achieving timely access to data objects is a major challenge in big distributed systems like the Internet of Things (IoT) platforms. Therefore, minimizing the data read and write operation time in distributed systems has elevated to a higher priority for system designers and mechanical engineers. Replication and the appropriate placement of the replicas on the most accessible data servers is a problem of NP-complete optimization. The key objectives of the current study are minimizing the data access time, reducing the quantity of replicas, and improving the data availability. The current paper employs the Olympiad Optimization Algorithm (OOA) as a novel population-based and discrete heuristic algorithm to solve the replica placement problem which is also applicable to other fields such as mechanical and computer engineering design problems. This discrete algorithm was inspired by the learning process of student groups who are preparing for the Olympiad exams. The proposed algorithm, which is divide-and-conquer-based with local and global search strategies, was used in solving the replica placement problem in a standard simulated distributed system. The 'European Union Database' (EUData) was employed to evaluate the proposed algorithm, which contains 28 nodes as servers and a network architecture in the format of a complete graph. It was revealed that the proposed technique reduces data access time by 39% with around six replicas, which is vastly superior to the earlier methods. Moreover, the standard deviation of the results of the algorithm's different executions is approximately 0.0062, which is lower than the other techniques' standard deviation within the same experiments.


Olympiad optimization algorithm, Distributed systems, Replica placement, Data access time, Stability, Availability

Full Text:



Qiu, L., Padmanabhan, V. N., Voelker, G. M., 2001, On the placement of web server replicas. Proc. IEEE INFOCOM 2001, Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society, 2001.

Li, B., Golin, M. J., Italiano, G. F., Deng, X., Sohraby, K., 1999, On the optimal placement of web proxies in the internet, In IEEE INFOCOM'99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies.

Szymaniak, M., Pierre, G., Van Steen, M., 2006, Latency-driven replica placement, IPSJ Digital Courier, 2, pp. 561-572.

Ng, T. E., Zhang, H., 2002, Predicting Internet network distance with coordinates-based approaches, Proc. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies, 2002.

Li, C., Liu, J., Lu, B., Luo, Y., 2021, Cost-aware automatic scaling and workload-aware replica management for edge-cloud environment, Journal of Network and Computer Applications, 180(4), 103017.

Li, C., Wang, Y., Tang, H., Zhang, Y., Xin, Y., Luo, Y., 2019, Flexible replica placement for enhancing the availability in edge computing environment, Computer Communications, 146(10), pp.1-14.

Li, C., Bai, J., Chen, Y., Luo, Y., 2020, Resource and replica management strategy for optimizing financial cost and user experience in edge cloud computing system, Information Sciences, 516(4), pp.33-55.

Safaee, S., Haghighat, A. T., 2012, Replica placement using genetic algorithm, Proc. International Conference on Innovation Management and Technology Research, pp. 507-512, IEEE 2012.

Abawajy, J. H., Deris, M. M., 2013, Data replication approach with consistency guarantee for data grid. IEEE Transactions on Computers, 63(12), pp. 2975-2987.

Shamsa, Z., Dehghan, M., 2013, Placement of replicas in distributed systems using particle swarm optimization algorithm and its fuzzy generalization, Proc. 13th Iranian Conference on Fuzzy Systems (IFSC), pp. 1-6, IEEE 2013.

Kolisch, R., Dahlmann, A., 2015, The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic, OR spectrum, 37(1), pp. 217-242.

Tu, M., Yen, I. L., 2014, Distributed replica placement algorithms for correlated data, The Journal of Supercomputing, 68(11), pp. 245-273.

Subramanyam, G., Lokesh, G., Kumari, B., 2013, A priori data replica placement strategy in grid computing. International Journal of Scientific and Engineering Research, 4(7), pp. 1070-1076.

Fan, W., Yang, L., Bouguila, N., 2022, Unsupervised Grouped Axial Data Modeling via Hierarchical Bayesian Nonparametric Models with Watson Distributions, IEEE Transactions on Pattern Analysis and Machine Intelligence, 44(12), pp. 9654-9668.

Liang, X., Huang, Z., Yang, S., Qiu, L., 2018, Device-Free Motion Trajectory Detection via RFID, ACM Transactions on Embedded Computing Systems, 17(4), 78.

Lu, C., Zheng, J., Yin, L., Wang, R., 2023, An improved iterated greedy algorithm for the distributed hybrid flowshop scheduling problem, Engineering Optimization. doi: 10.1080/0305215X.2023.2198768

Wang, Z., Zhao, D., Guan, Y., 2023, Flexible-constrained time-variant hybrid reliability-based design optimization, Structural and Multidisciplinary Optimization, 66(4), pp. 89-103.

Hu, D., Li, Y., Yang, X., Liang, X., Zhang, K., Liang, X., Taciroglu, E., 2023, Experiment and Application of NATM Tunnel Deformation Monitoring Based on 3D Laser Scanning, Structural Control and Health Monitoring, 2023, 3341788.

Qu, Z., Zhang, Z., Liu, B., Tiwari, P., Ning, X., Muhammad, K. 2023, Quantum detectable Byzantine agreement for distributed data trust management in blockchain, Information Sciences, 637(8), 118909.

Li, K., Ji, L., Yang, S., Li, H., Liao, X., 2022, Couple-Group Consensus of Cooperative–Competitive Heterogeneous Multiagent Systems: A Fully Distributed Event-Triggered and Pinning Control Method, IEEE Transactions on Cybernetics, 52(6), pp. 4907-4915.

Zhou, G., Zhang, R., Huang, S., 2021, Generalized Buffering Algorithm. IEEE access, 9, pp. 27140-27157.

Ni, Q., Guo, J., Wu, W., Wang, H., 2022, Influence-Based Community Partition with Sandwich Method for Social Networks. IEEE Transactions on Computational Social Systems, 10(2), pp. 819-830.

Wang, K., Zhang, B., Alenezi, F., Li, S., 2022, Communication-efficient surrogate quantile regression for non-randomly distributed system, Information sciences, 588 (4), pp. 425-441.

Yuan, H., Yang, B., 2022, System Dynamics Approach for Evaluating the Interconnection Performance of Cross-Border Transport Infrastructure, Management in Engineering, 38(3), 04022008.

Li, P., Hu, J., Qiu, L., Zhao, Y., Ghosh, B. K, 2022, A Distributed Economic Dispatch Strategy for Power–Water Networks, IEEE Transactions on Control of Network Systems, 9(1), pp. 356-366.

Song, Y., Xin, R., Chen, P., Zhang, R., Chen, J., Zhao, Z., 2023, Identifying performance anomalies in fluctuating cloud environments: A robust correlative-GNN-based explainable approach, Future Generation Computer Systems, 145 (3), pp. 77-86.

Deng, Y., Zhang, W., Xu, W., Shen, Y., Lam, W., 2023, Nonfactoid Question Answering as Query-Focused Summarization with Graph-Enhanced Multihop Inference, IEEE Transactions on Neural Networks and Learning Systems. doi: 10.1109/TNNLS.2023.3258413.

Cheng, B., Wang, M., Zhao, S., Zhai, Z., Zhu, D., Chen, J., 2017, Situation-Aware Dynamic Service Coordination in an IoT Environment, IEEE/ACM Transactions on Networking, 25(4), pp. 2082-2095.

Lu, S., Liu, M., Yin, L., Yin, Z., Liu, X., Zheng, W., Kong, X, 2023, The multi-modal fusion in visual question answering: a review of attention mechanisms, PeerJ Computer Science, 9(5), e1400.

Liu, X., Shi, T., Zhou, G., Liu, M., Yin, Z., Yin, L., Zheng, W, 2023, Emotion classification for short texts: an improved multi-label method, Humanities and Social Sciences Communications, 10(1), 306.

Liu, X., Zhou, G., Kong, M., Yin, Z., Li, X., Yin, L., Zheng, W, 2023, Developing Multi-Labelled Corpus of Twitter Short Texts: A Semi-Automatic Method, Systems, 11(8), 390.

Lu, S., Ding, Y., Liu, M., Yin, Z., Yin, L., Zheng, W, 2023, Multiscale Feature Extraction and Fusion of Image and Text in VQA, International Journal of Computational Intelligence Systems, 16(1), pp. 54-2023.

Cao, B., Gu, Y., Lv, Z., Yang, S., Zhao, J., Li, Y, 2021, RFID Reader Anticollision Based on Distributed Parallel Particle Swarm Optimization. IEEE internet of things journal, 8(5), pp. 3099-3107.

Arasteh, B., Sadegi, R., Arasteh, K., Gunes, P., Kiani, F., Torkamanian-Afshar, M., 2023, A bioinspired discrete heuristic algorithm to generate the effective structural model of a program source code, Journal of King Saud University-Computer and Information Sciences, 35(8), 101655.

Arasteh, B., Miremadi, S. G., Rahmani, A. M, 2014, Developing inherently resilient software against soft errors based on algorithm level inherent features, Journal of Electronic Testing, 30 (2), pp. 193-212.

Arasteh, B., Sadegi, R., Arasteh, K, 2021, Bölen: Software module clustering method using the combination of shuffled frog leaping and genetic algorithm, Data Technologies and Applications, 55(2), pp. 251-279.

ZadahmadJafarlou, M., Arasteh, B., YousefzadehFard, P., 2011, A pattern-oriented and web-based architecture to support mobile learning software development, Procedia-Social and Behavioral Sciences, 28, pp. 194-199.

Hatami, E., Arasteh, B, 2020, An efficient and stable method to cluster software modules using ant colony optimization algorithm, The Journal of Supercomputing, 76(9), pp. 6786-6808.

Arasteh, B., Sadegi, R., Arasteh, K, 2020, ARAZ: A software modules clustering method using the combination of particle swarm optimization and genetic algorithms, Intelligent Decision Technologies, 14(4), pp. 449-462.

Arasteh, B., Najafi, J., 2018, Programming guidelines for improving software resiliency against soft errors without performance overhead, Computing, 100(2), pp. 971-1003.

Arasteh, B., Fatolahzadeh, A., Kiani, F., 2022, Savalan: Multi objective and homogeneous method for software modules clustering, Journal of Software: Evolution and Process, 34(1), e2408.

Afshord, S. T., Pottosin, Y., Arasteh, B., 2015, An input variable partitioning algorithm for functional decomposition of a system of Boolean functions based on the tabular method, Discrete Applied Mathematics, 185, pp. 208-219.

Arasteh, B., 2023, Clustered design-model generation from a program source code using chaos-based metaheuristic algorithms, Neural Computing and Applications, 35(4), pp. 3283-3305.

Bouyer, A., Beni, H. A., Arasteh, B., Aghaee, Z., Ghanbarzadeh, R., 2023, FIP: A fast overlapping community-based Influence Maximization Algorithm using probability coefficient of global diffusion in social networks, Expert systems with applications, 213 (3), 118869.

Arasteh, B., Pirahesh, S., Zakeri, A., Arasteh, B., 2014, Highly available and dependable E-learning services using grid system, Procedia-Social and Behavioral Sciences, 143, pp. 471-476.

Nezhadroshan, A. M., Fathollahi-Fard, A. M., Hajiaghaei-Keshteli, M., 2021, A scenario-based possibilistic-stochastic programming approach to address resilient humanitarian logistics considering travel time and resilience levels of facilities. International Journal of Systems Science: Operations Logistics, 8(4), pp. 321-347.

Golshahi-Roudbaneh, A., Hajiaghaei-Keshteli, M., Paydar, M. M., 2017, Developing a lower bound and strong heuristics for a truck scheduling problem in a cross-docking center. Knowledge-Based Systems, 129, pp. 17-38.

Babaeinesami, A., Tohidi, H., Ghasemi, P., Goodarzian, F., Tirkolaee, E. B., 2022, A closed-loop supply chain configuration considering environmental impacts: a self-adaptive NSGA-II algorithm, Applied Intelligence, 52(12), pp. 13478-13496.

Tirkolaee, E. B., Goli, A., Mardani, A., 2021, A novel two-echelon hierarchical location-allocation-routing optimization for green energy-efficient logistics systems, Annals of operations research, 324(11), pp. 795–823.

Aghighi, A., Goli, A., Malmir, B., Tirkolaee, E. B. 2021, The stochastic location-routing-inventory problem of perishable products with reneging and balking, Journal of Ambient Intelligence and Humanized Computing, 14(10), pp. 6497–6516.

Sahebjamnia, N., Goodarzian, F., Hajiaghaei-Keshteli, M., 2020, Optimization of multi-period three-echelon citrus supply chain problem, Journal of Optimization in Industrial Engineering, 13(1), pp. 39-53.

Mahmood, L., Bahroun, Z., Ghommem, M., Alshraideh, H., 2022, Assessment and performance analysis of Machine learning techniques for gas sensing E-nose systems. Facta Universitatis, Series: Mechanical Engineering, 20(3), pp. 479-501.

Ewertowski, T., Güldoğuş, B. Ç., Kuter, S., Akyüz, S., Weber, G. W., Sadłowska-Wrzesińska, J., Racek, E., 2023, The use of machine learning techniques for assessing the potential of organizational resilience, Central European Journal of Operations Research, 31(1),

Weber, G. W., Arabnia, H., Aydın, N. S., Tirkolaee, E. B, 2023, Preface: advances of machine learning and optimization in healthcare systems and medicine. Annals of Operations Research, 328 (1), pp. 1-2.

Vasant, P., Zelinka, I., Weber, G. W., 2019, Intelligent computing optimization, Berlin: Springer International Publishing.

Çevik, A., Weber, G. W., Eyüboğlu, B. M., Oğuz, K. K., 2017, Voxel-MARS: a method for early detection of Alzheimer’s disease by classification of structural brain MRI, Annals of Operations Research, 258, pp. 31-57.

Graczyk-Kucharska, M., Olszewski, R., Golinski, M., Spychala, M., Szafranski, M., Weber, G. W., Miadowicz, M. ,2022, Human resources optimization with MARS and ANN: innovation geolocation model for generation Z, Journal of Industrial and Management Optimization, 18(6), pp. 4093-4110. (last access: 05.07.2023).



  • There are currently no refbacks.

ISSN: 0354-2025 (Print)

ISSN: 2335-0164 (Online)

COBISS.SR-ID 98732551

ZDB-ID: 2766459-4