Skip to main content

Advertisement

SpringerLink
Log in

A discrete heuristic algorithm with swarm and evolutionary features for data replication problem in distributed systems

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

Availability and accessibility of data objects in a reasonable time is a main issue in distributed systems like cloud computing services. As a result, the reduction of data-related operation times in distributed systems such as data read/write has become a major challenge in the development of these systems. In this regard, replicating the data objects on different servers is one commonly used technique. In general, replica placement plays an essential role in the efficiency of distributed systems and can be implemented statically or dynamically. Estimation of the minimum number of data replicas and the optimal placement of the replicas is an NP-complete optimization problem. Hence, different heuristic algorithms have been proposed for optimal replica placement in distributed systems. Reducing data processing costs as well as the number of replicas, and increasing the reliability of the replica placement algorithms are the main goals of this research. This paper presents a discrete and swarm-evolutionary method using a combination of shuffle-frog leaping and genetic algorithms to data-replica placement problems in distributed systems. The experiments on the standard dataset show that the proposed method reduces data access time by up to 30% with about 14 replicas; whereas the generated replicas by the GA and ACO are, respectively, 24 and 30. The average reduction in data access time by GA and ACO 21% and 18% which shows less efficiency than the SFLA–GA algorithm. Regarding the results, the SFLA–GA converges on the optimal solution before the 10th iteration, which shows the higher performance of the proposed method. Furthermore, the standard deviation among the results obtained by the proposed method on several runs is about 0.029, which is lower than other algorithms. Additionally, the proposed method has a higher success rate than other algorithms in the replica placement problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22

Similar content being viewed by others

Availability of data and materials

The datasets generated during study and the implemented code are freely available by the following link: https://drive.google.com/drive/folders/1eWphbxHIWyU1Ii55NnaooU39eT5P9qGr?usp=share_link

References

  1. Li C, Liu J, Lu B, Luo Y (2021) Cost-aware automatic scaling and workload-aware replica management for edge-cloud environment. J Netw Comput Appl 180:103017. https://doi.org/10.1016/j.jnca.2021.103017

    Article  Google Scholar 

  2. Li C, Wang Y, Tang H, Zhang Y, Xin Y, Luo Y (2019) Flexible replica placement for enhancing the availability in edge computing environment. Comput Commun 146:1–14. https://doi.org/10.1016/j.comcom.2019.07.013

    Article  Google Scholar 

  3. Qiu L, Padmanabhan VN and Voelker GM (2001) On the placement of web server replicas. In: Twentieth annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE, pp 1587–1596

  4. Golin B, Li M, Italiano F, Deng X, Sohraby K (1999) On the optimal placement of web proxies in the internet. In: Eighteenth annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE, pp 1282–1290

  5. Ng TSE and Zhang H (2002) Predicting internet network distance with coordinates-based approaches. In: Twenty-first annual joint conference of the IEEE computer and communications societies. Proceedings. IEEE, pp 170–179

  6. Szymaniak M, Pierre G, Van Steen M (2005) Latency-driven replica placement. In: Applications and the internet, proceedings, pp 399–405

  7. Safaee S and Haghighat AT (2012) Replica placement using genetic algorithm.In: Innovation management and technology research (ICIMTR), international conference on, pp 507–512

  8. Abawajy JH, Deris MM (2014) Data replication approach with consistency guarantee for data grid. IEEE Trans Comput 63(12):2975–2987. https://doi.org/10.1109/tc.2013.183

    Article  MathSciNet  MATH  Google Scholar 

  9. Shamsa Z and Dehghan M (2013) Placement of replica in distributed system using swarm optimization algorithm and its fuzzy generalization. In: 13th International conference on fuzzy system (IFSC), pp 1–6

  10. Kolisch R, Dahlmann A (2014) The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic. OR Spectr 37(1):217–242. https://doi.org/10.1007/s00291-013-0358-z

    Article  MathSciNet  MATH  Google Scholar 

  11. Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129–154. https://doi.org/10.1080/03052150500384759

    Article  MathSciNet  Google Scholar 

  12. Ghaemi A, Arasteh B (2019) SFLA-based heuristic method to generate software structural test data. J Softw Evol Process. https://doi.org/10.1002/smr.2228

    Article  Google Scholar 

  13. Arasteh B, Miremadi SG, Rahmani AM (2014) Developing inherently resilient software against soft-errors based on algorithm level inherent features. J Electron Test 30(2):193–212. https://doi.org/10.1007/s10836-014-5438-8

    Article  Google Scholar 

  14. Arasteh B, Sadegi R, Arasteh K (2021) ARAZ: a software modules clustering method using the combination of particle swarm optimization and genetic algorithms. Intell Decis Technol 14(4):449–462. https://doi.org/10.3233/idt-200070

    Article  Google Scholar 

  15. Arasteh B, Najafi J (2018) Programming guidelines for improving software resiliency against soft errors without performance overhead. Computing 100(9):971–1003. https://doi.org/10.1007/s00607-018-0592-y

    Article  MathSciNet  Google Scholar 

  16. Arasteh B, Fatolahzadeh A, Kiani F (2021) Savalan: multi objective and homogeneous method for software modules clustering. J Softw Evol Process. https://doi.org/10.1002/smr.2408

    Article  Google Scholar 

  17. Arasteh B (2022) Clustered design-model generation from a program source code using chaos-based metaheuristic algorithms. Neural Comput Appl. https://doi.org/10.1007/s00521-022-07781-6

    Article  Google Scholar 

  18. Arasteh B, Abdi M, Bouyer A (2022) Program source code comprehension by module clustering using combination of discretized gray wolf and genetic algorithms. Adv Eng Softw 173:103252. https://doi.org/10.1016/j.advengsoft.2022.103252

    Article  Google Scholar 

  19. Bouyer A, Arasteh B, Movaghar A (2007) A new hybrid model using case-based reasoning and decision tree methods for improving speedup and accuracy. In: IADIS international conference of applied computing, pp 20–28

  20. Hatami E, Arasteh B (2019) An efficient and stable method to cluster software modules using ant colony optimization algorithm. J Supercomput 76(9):6786–6808. https://doi.org/10.1007/s11227-019-03112-0

    Article  Google Scholar 

  21. Keshtgar A, Arasteh B (2017) Enhancing software reliability against soft-error using minimum redundancy on critical data. J Comput Netw Inf Secur. https://doi.org/10.5815/ijcnis.2017.05.03

    Article  Google Scholar 

  22. Zadahmad M, Arasteh B, YousefzadehFard P (2011) A pattern-oriented and web-based architecture to support mobile learning software development. Procedia Soc Behav Sci 28:194–199. https://doi.org/10.1016/j.sbspro.2011.11.037

    Article  Google Scholar 

  23. Chen H, Li C, Mafarja M, Heidari AA, Chen Y, Cai Z (2022) Slime mould algorithm: a comprehensive review of recent variants and applications. Int J Syst Sci 54(1):204–235. https://doi.org/10.1080/00207721.2022.2153635

    Article  MATH  Google Scholar 

  24. Wu HC (2022) Solving multiobjective optimization problems using genetic algorithms and solutions concepts of cooperative games. Int J Syst Sci 53(14):3095–3111. https://doi.org/10.1080/00207721.2022.2070793

    Article  MATH  Google Scholar 

Download references

Funding

The authors declare that no funds were received during the preparation of this manuscript.

Author information

Authors and Affiliations

  1. Department of Software Engineering, Faculty of Engineering and Natural Science, Istinye University, Istanbul, Turkey

    Bahman Arasteh & Tofigh Allahviranloo

  2. Department of Software Engineering, Faculty of Engineering, Dogus University, Istanbul, Turkey

    Peri Funes

  3. Computer Engineering Department, Faculty of Engineering and Architecture, Nisantasi University, 34398, Istanbul, Turkey

    Mahsa Torkamanian-Afshar

  4. School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi, Delhi, India

    Manju Khari

  5. College of Engineering and Technology, American University of the Middle East, Kuwait, Kuwait

    Muammer Catak

Authors
  1. Bahman Arasteh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tofigh Allahviranloo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peri Funes
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mahsa Torkamanian-Afshar
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Manju Khari
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Muammer Catak
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Research problem, method design, implementation and experiments have been performed by BA. Data analysis has been performed by BA. BA, TA and PG have made results analysis. BA, MC, MK, and MT-A read and approved the final manuscript.

Corresponding author

Correspondence to Bahman Arasteh.

Ethics declarations

Conflict of interest

All authors state that there is no conflict of interest.

Ethical approval

All authors state that this study is the authors’ original work, which has not been previously published elsewhere. The paper is not currently being considered for publication elsewhere. The paper reflects the author’s own research and analysis truthfully and completely.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Arasteh, B., Allahviranloo, T., Funes, P. et al. A discrete heuristic algorithm with swarm and evolutionary features for data replication problem in distributed systems. Neural Comput & Applic 35, 23177–23197 (2023). https://doi.org/10.1007/s00521-023-08853-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-023-08853-x

Keywords

Search

Navigation