DATA REPLICATION IN DISTRIBUTED SYSTEMS USING OLYMPIAD OPTIMIZATION ALGORITHM

Basit Öğe Kaydı
dc.authoridBouyer, Asgarali/0000-0002-4808-2856
dc.authoridTirkolaee, Erfan Babaee/0000-0003-1664-9210
dc.authoridArasteh, Bahman/0000-0001-5202-6315
dc.authoridRouhi, Alireza/0000-0003-1494-3467
dc.authoridGhanbarzadeh, Reza/0000-0001-9073-1576
dc.authorwosidBouyer, Asgarali/IYS-5116-2023
dc.authorwosidTirkolaee, Erfan Babaee/U-3676-2017
dc.authorwosidArasteh, Bahman/AAN-9555-2021
dc.authorwosidRouhi, Alireza/L-2209-2018
dc.contributor.authorArasteh, Bahman
dc.contributor.authorBouyer, Asgarali
dc.contributor.authorGhanbarzadeh, Reza
dc.contributor.authorRouhi, Alireza
dc.contributor.authorMehrabani, Mahsa Nazeri
dc.contributor.authorTirkolaee, Erfan Babaee
dc.date.accessioned2024-05-19T14:46:05Z
dc.date.available2024-05-19T14:46:05Z
dc.date.issued2023
dc.departmentİstinye Üniversitesien_US
dc.description.abstractAchieving 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.en_US
dc.identifier.doi10.22190/FUME230707033A
dc.identifier.endpage527en_US
dc.identifier.issn0354-2025
dc.identifier.issn2335-0164
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-85175494377en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage501en_US
dc.identifier.urihttps://doi.org10.22190/FUME230707033A
dc.identifier.urihttps://hdl.handle.net/20.500.12713/5439
dc.identifier.volume21en_US
dc.identifier.wosWOS:001095955400008en_US
dc.identifier.wosqualityN/Aen_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherUniv Nisen_US
dc.relation.ispartofFacta Universitatis-Series Mechanical Engineeringen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.snmz20240519_kaen_US
dc.subjectOlympiad Optimization Algorithmen_US
dc.subjectDistributed Systemsen_US
dc.subjectReplica Placementen_US
dc.subjectData Access Timeen_US
dc.subjectStabilityen_US
dc.subjectAvailabilityen_US
dc.titleDATA REPLICATION IN DISTRIBUTED SYSTEMS USING OLYMPIAD OPTIMIZATION ALGORITHMen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

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