Efficient multi-cloud storage using online dynamic replication and placement algorithms for online social networks
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 hav...
| المؤلفون الرئيسيون: | , , , , |
|---|---|
| التنسيق: | مقال |
| منشور في: |
Institute of Electrical and Electronics Engineers Inc.
2024
|
| _version_ | 1825939333965676544 |
|---|---|
| author | Aldailamy, Ali Y. Muhammed, Abdullah Abdul Hamid, Nor Asilah Wati Latip, Rohaya Ismail, Waidah |
| author_facet | Aldailamy, Ali Y. Muhammed, Abdullah Abdul Hamid, Nor Asilah Wati Latip, Rohaya Ismail, Waidah |
| author_sort | Aldailamy, Ali Y. |
| collection | UPM |
| description | 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. |
| first_indexed | 2024-09-25T03:39:04Z |
| format | Article |
| id | upm.eprints-106213 |
| institution | Universiti Putra Malaysia |
| last_indexed | 2024-09-25T03:39:04Z |
| publishDate | 2024 |
| publisher | Institute of Electrical and Electronics Engineers Inc. |
| record_format | dspace |
| spelling | upm.eprints-1062132024-05-07T23:01:37Z http://psasir.upm.edu.my/id/eprint/106213/ Efficient multi-cloud storage using online dynamic replication and placement algorithms for online social networks Aldailamy, Ali Y. Muhammed, Abdullah Abdul Hamid, Nor Asilah Wati Latip, Rohaya Ismail, Waidah 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. Institute of Electrical and Electronics Engineers Inc. 2024 Article PeerReviewed Aldailamy, Ali Y. and Muhammed, Abdullah and Abdul Hamid, Nor Asilah Wati and Latip, Rohaya and Ismail, Waidah (2024) Efficient multi-cloud storage using online dynamic replication and placement algorithms for online social networks. IEEE Access, 12. pp. 20409-20425. ISSN 2169-3536 https://ieeexplore.ieee.org/document/10418881 10.1109/ACCESS.2024.3361748 |
| spellingShingle | Aldailamy, Ali Y. Muhammed, Abdullah Abdul Hamid, Nor Asilah Wati Latip, Rohaya Ismail, Waidah Efficient multi-cloud storage using online dynamic replication and placement algorithms for online social networks |
| title | Efficient multi-cloud storage using online dynamic replication and placement algorithms for online social networks |
| title_full | Efficient multi-cloud storage using online dynamic replication and placement algorithms for online social networks |
| title_fullStr | Efficient multi-cloud storage using online dynamic replication and placement algorithms for online social networks |
| title_full_unstemmed | Efficient multi-cloud storage using online dynamic replication and placement algorithms for online social networks |
| title_short | Efficient multi-cloud storage using online dynamic replication and placement algorithms for online social networks |
| title_sort | efficient multi cloud storage using online dynamic replication and placement algorithms for online social networks |
| work_keys_str_mv | AT aldailamyaliy efficientmulticloudstorageusingonlinedynamicreplicationandplacementalgorithmsforonlinesocialnetworks AT muhammedabdullah efficientmulticloudstorageusingonlinedynamicreplicationandplacementalgorithmsforonlinesocialnetworks AT abdulhamidnorasilahwati efficientmulticloudstorageusingonlinedynamicreplicationandplacementalgorithmsforonlinesocialnetworks AT latiprohaya efficientmulticloudstorageusingonlinedynamicreplicationandplacementalgorithmsforonlinesocialnetworks AT ismailwaidah efficientmulticloudstorageusingonlinedynamicreplicationandplacementalgorithmsforonlinesocialnetworks |