Publication:
Efficient Multi-Cloud Storage Using Online Dynamic Replication and Placement Algorithms for Online Social Networks

Simple item page
dc.contributor.authorAli Y. Aldailamy
dc.contributor.authorAbdullah Muhammed
dc.contributor.authorNor Asilah Wati Abdul Hamid
dc.contributor.authorRohaya Lati
dc.contributor.authorWaidah Ismail
dc.date.accessioned2024-08-23T17:04:45Z
dc.date.available2024-08-23T17:04:45Z
dc.date.issued2024
dc.date.submitted2024-8-23
dc.descriptionIEEE Access Volume 12(Page:20409 - 20425)
dc.description.abstractThe 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.
dc.identifier.citationAli 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.
dc.identifier.doi10.1109/ACCESS.2024.3361748
dc.identifier.epage20425
dc.identifier.issn2169-3536
dc.identifier.issue13
dc.identifier.spage20409
dc.identifier.urihttps://ieeexplore.ieee.org/document/10418881
dc.identifier.urihttps://oarep.usim.edu.my/handle/123456789/22268
dc.identifier.urihttps://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=0
dc.identifier.volume12
dc.language.isoen_US
dc.publisherIEEE Access
dc.relation.ispartofIEEE Access
dc.relation.journalIEEE Access
dc.subjectDynamic replication
dc.subjectlatency and cost optimization
dc.subjectmulti-cloud
dc.subjectonline placement algorithm
dc.subjectonline social network
dc.subjectstorage as a service
dc.titleEfficient Multi-Cloud Storage Using Online Dynamic Replication and Placement Algorithms for Online Social Networks
dc.typetext::journal::journal article::research article
dspace.entity.typePublication
oaire.citation.endPage20425
oaire.citation.startPage20409
oaire.citation.volume12
oairecerif.author.affiliation#PLACEHOLDER_PARENT_METADATA_VALUE#
oairecerif.author.affiliation#PLACEHOLDER_PARENT_METADATA_VALUE#
oairecerif.author.affiliation#PLACEHOLDER_PARENT_METADATA_VALUE#
oairecerif.author.affiliation#PLACEHOLDER_PARENT_METADATA_VALUE#
oairecerif.author.affiliationUniversiti Sains Islam Malaysia

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Efficient Multi-Cloud Storage Using Online Dynamic Replication and Placement Algorithms for Online Social Networks.pdf
Size:
3.29 MB
Format:
Adobe Portable Document Format
Download

Collections

Scopus