Please use this identifier to cite or link to this item: https://doi.org/10.1109/NAS.2010.24
Title: Dynamic replication management for object-based storage system
Authors: Wei, Q.
Veeravalli, B. 
Li, Z.
Keywords: Load balance
Object-based storage system
Replication management
Issue Date: 2010
Citation: Wei, Q.,Veeravalli, B.,Li, Z. (2010). Dynamic replication management for object-based storage system. Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010 : 412-419. ScholarBank@NUS Repository. https://doi.org/10.1109/NAS.2010.24
Abstract: Data replication has been widely used as a mean of increasing the data availability of large-scale storage systems where failures are normal. Aiming to provide cost-effective availability, and improve performance and load-balancing of large-scale storage cluster, this paper presents a dynamic replication management scheme referred to as DRM. A model is developed to express availability as function of replica number. Based on this model, minimal replica number to satisfy availability requirement can be determined. DRM further places these replicas among Object-Based Storage Devices (OSD) in a balance way, taking into account different capacity and blocking probability of each OSD in heterogeneous environment. Proposed DRM can dynamically redistribute workloads among OSD cluster by adjusting replica number and location according to workload changing and OSD capacity. Our experiment results conclusively demonstrate that DRM is reliable and can achieve a significant average response time, and load balancing for large-scale OSD cluster. © 2010 IEEE.
Source Title: Proceedings - 2010 IEEE International Conference on Networking, Architecture and Storage, NAS 2010
URI: http://scholarbank.nus.edu.sg/handle/10635/70047
ISBN: 9780769541341
DOI: 10.1109/NAS.2010.24
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.