Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    New user? Click here to register.Have you forgotten your password?
Repository logo
    Communities & Collections
    Research Outputs
    Fundings & Projects
    People
    Statistics
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Srpski (lat)
  • Suomi
  • Svenska
  • Türkçe
  • Tiếng Việt
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Српски
  • Yкраї́нська
  • Log In
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Nor Asilah Wati Abdul Hamid"

Now showing 1 - 2 of 2
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Publication
    Efficient Multi-Cloud Storage Using Online Dynamic Replication and Placement Algorithms for Online Social Networks
    (IEEE Access, 2024)
    Ali Y. Aldailamy
    ;
    Abdullah Muhammed
    ;
    Nor Asilah Wati Abdul Hamid
    ;
    Rohaya Lati
    ;
    Waidah Ismail 
    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.
      6  20
  • Loading...
    Thumbnail Image
    Some of the metrics are blocked by your 
    consent settings
    Publication
    Online Dynamic Replication and Placement Algorithms for Cost Optimization of Online Social Networks in Two-tier Multi-cloud
    (Elsevier, 2024)
    Ali Y. Aldailamy
    ;
    Abdullah Muhammed
    ;
    Rohaya Latip
    ;
    Nor Asilah Wati Abdul Hamid
    ;
    Waidah Ismail 
    In social media, a huge number of worldwide data objects are posted every day. The contents of these data objects include text, links, images, audio, and videos which could be small, medium, or large and accessed across the world. Moving these data objects into a single cloud service provider (CSP) is risky and results in four-fold obstacles: vendor lock-in, service availability, cost-ineffective use, and increasing latency. Using multiple CSPs to replicate and distribute the data object solves such obstacles. However, replicating data objects among multiple CSPs increases the cost of creating and maintaining this replication. This study focuses on three issues of Online Social Network (OSN) which include: (1) determining the appropriate number of replicas of each data object based on its popularity on the OSN, (2) identifying the suitable datacenters that host the replicas according to latency time of different regions, and (3) deciding the suitable storage class for the data object at a specific time of its lifetime. Two algorithms are proposed to adapt the replication and placement of the data object according to its popularity in the OSN. The first algorithm is Dynamic Fixed Time (DFT) which uses fixed time periods to adapt replication and placement. The second algorithm is Dynamic Exponential Time (DET) which determines the data object replication and placement based on exponential time periods. A simulation using a synthesized workload generated based on a real Facebook statistic dataset shows that the proposed algorithms produce a monetary cost savings of more than 23% compared to the Static Replication and Local Placement (SRLP) algorithm.
      11  16
Welcome to SRP

"A platform where you can access full-text research
papers, journal articles, conference papers, book
chapters, and theses by USIM researchers and students.”

Contact:
  • ddms@usim.edu.my
  • 06-798 6206 / 6221
  • USIM Library
Follow Us:
READ MORE Copyright © 2024 Universiti Sains Islam Malaysia