Ali Y. AldailamyAbdullah MuhammedNor Asilah Wati Abdul HamidRohaya LatiWaidah Ismail2024-08-232024-08-2320242024-8-23Ali Y. , A., Abdullah, M., Nor Asilah Wati Abdul Hamid, Rohaya Latip, & Waidah Ismail. (2024). Efficient Multi-Cloud Storage Using Online Dynamic Replication and Placement Algorithms for Online Social Networks. IEEE Access, 12, 20409–20425.2169-353610.1109/ACCESS.2024.3361748https://ieeexplore.ieee.org/document/10418881https://oarep.usim.edu.my/handle/123456789/22268https://www.scopus.com/record/display.uri?eid=2-s2.0-85184315023&origin=resultslist&sort=plf-f&src=s&sid=838a8aea8db0c32a722ba8e8748ac89d&sot=b&sdt=b&s=TITLE-ABS-KEY%28Efficient+Multi-Cloud+Storage+Using+Online+Dynamic+Replication+and+Placement+Algorithms+for+Online+Social+Networks%29&sl=129&sessionSearchId=838a8aea8db0c32a722ba8e8748ac89d&relpos=0IEEE Access Volume 12(Page:20409 - 20425)The provision of Storage as a Service (STaaS) in many geo-distributed datacenters by several Cloud Storage Providers (CSPs) has made online cloud storage a great choice for replicating and distributing objects that are accessed worldwide. Online Social Networks (OSN) such as Facebook and Twitter have billions of active users worldwide accessing shared objects. These users expect to access these objects within a tolerable time. To minimize users’ access latency time of these objects, OSN service providers must host several replicas of objects in many datacenters. However, this replication process produces a higher monetary cost. This paper addresses crucial issues, including how many replicas are required to fulfil the expected workload of the object and the optimal datacenters to host these replicas to reduce latency time for users and monetary costs for OSN service providers. Two online algorithms are proposed to determine the suitable number of replicas for each object and the optimal placement of these replicas. The DTS algorithm establishes the replication and placement of objects using deterministic time slots, while the RTS algorithm is based on randomized time slots. Experimental results show the effectiveness of the proposed algorithms for producing latency time below certain thresholds and reducing the monetary cost.en-USDynamic replicationlatency and cost optimizationmulti-cloudonline placement algorithmonline social networkstorage as a servicetext::journal::journal article::research article20409204251213