A hybrid chaos-based algorithm for data object replication in distributed systems

Basit Öğe Kaydı
dc.authoridArasteh, Bahman/0000-0001-5202-6315
dc.authoridGhanbarzadeh, Reza/0000-0001-9073-1576
dc.authorwosidArasteh, Bahman/AAN-9555-2021
dc.authorwosidBouyer, Asgarali/JOZ-6483-2023
dc.contributor.authorArasteh, Bahman
dc.contributor.authorGunes, Peri
dc.contributor.authorBouyer, Asgarali
dc.contributor.authorRouhi, Alireza
dc.contributor.authorGhanbarzadeh, Reza
dc.date.accessioned2024-05-19T14:39:57Z
dc.date.available2024-05-19T14:39:57Z
dc.date.issued2024
dc.departmentİstinye Üniversitesien_US
dc.description.abstractOne of the primary challenges in distributed systems, such as cloud computing, lies in ensuring that data objects are accessible within a reasonable timeframe. To address this challenge, the data objects are replicated across multiple servers. Estimating the minimum quantity of data replicas and their optimal placement is considered an NP-complete optimization problem. The primary objectives of the current research include minimizing data processing costs, reducing the quantity of replicas, and maximizing the applied algorithms' reliability in replica placement. This paper introduces a hybrid chaos-based swarm approach using the modified shuffle-frog leaping algorithm with a new local search strategy for replicating data in distributed systems. Taking into account the algorithm's performance in static settings, the introduced method reduces the expenses associated with replica placement. The results of the experiment conducted on a standard data set indicate that the proposed approach can decrease data access time by about 33% when using approximately seven replicas. When executed several times, the suggested method yields a standard deviation of approximately 0.012 for the results, which is lower than the result existing algorithms produce. Additionally, the new approach's success rate is higher in comparison with existing algorithms used in addressing the problem of replica placement.en_US
dc.identifier.doi10.1080/03081079.2024.2313159
dc.identifier.issn0308-1079
dc.identifier.issn1563-5104
dc.identifier.scopus2-s2.0-85186928960en_US
dc.identifier.scopusqualityQ2en_US
dc.identifier.urihttps://doi.org10.1080/03081079.2024.2313159
dc.identifier.urihttps://hdl.handle.net/20.500.12713/4879
dc.identifier.wosWOS:001179068400001en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherTaylor & Francis Ltden_US
dc.relation.ispartofInternational Journal of General Systemsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.snmz20240519_kaen_US
dc.subjectChaos Theoryen_US
dc.subjectShuffle-Frog Leaping Algorithmen_US
dc.subjectSfla Optimizationen_US
dc.subjectData Access Timeen_US
dc.subjectDistributed Systemsen_US
dc.subjectReplica Placementen_US
dc.titleA hybrid chaos-based algorithm for data object replication in distributed systemsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu