Cost Optimization of Replicas in Tree Network of Data Grid with QoS and Bandwidth Constraints

Data Grid provides resources for data-intensive scientific applications that need to access a huge amount of data around the world. Since data grid is built on a wide-area network, its latency prohibits efficient access to data. This latency can be decreased by data replication in the vicinity of users who request data. Data replication can also improve data availability and decreases network bandwidth usage. It can be influenced by two imperative constraints: Quality of Service (QoS) that is locally owned by a user and bandwidth constraint that globally affects on link that might be shared by multiple users. Guaranteeing both constraints and also minimizing replication cost consisting communication and storage costs is a challenging task. To address this problem, the authors propose to use a dynamic algorithm called Optimal Placement of Replicas to minimize replication cost and coupled with meeting both mentioned constraints. It is also designed as heuristic algorithms that are competitive with optimal algorithm in performance metrics such as replication cost, network bandwidth usage and data availability. Extensive simulations show that the Optimal algorithm saves 10% cost compared to heuristic algorithms and provides local responsiveness for half of the user requests.

@article{Chamkoori2017,
  title     = {Cost Optimization of Replicas in Tree Network of Data Grid with QoS and Bandwidth Constraints},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {8},
  number    = {6},
  year      = {2017},
  publisher = {The Science and Information Organization},
  author    = {Alireza Chamkoori and Farnoosh Heidari and Naser Parhizgar},
  doi       = {10.14569/IJACSA.2017.080662},
  url       = {https://doi.org/10.14569/IJACSA.2017.080662}
}