On storage allocation for maximum service rate in distributed storage systems
Authors:
- 11 August 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 240-244
Abstract
Storage allocation affects important performance measures of distributed storage systems. Most previous studies on the storage allocation consider its effect separately either on the success of the data recovery or on the service rate (time) where it is assumed that no access failure happens in the system. In this paper, we go one step further and incorporate the access model and the success of data recovery into the service rate analysis. In particular, we focus on quasi-uniform storage allocation and provide a service rate analysis for both fixed-size and probabilistic access models at the nodes. Using this analysis, we then show that for the case of exponential waiting time distribution at individuals storage nodes, minimal spreading allocation results in the highest system service rate for both access models. This means that for a given storage budget, replication provides a better service rate than a coded storage solution.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Allocation for Heterogeneous Storage NodesIEEE Communications Letters, 2015
- Analyzing the download time of availability codes2015
- New bounds for distributed storage systems with secure repair2014
- Asymptotic analysis of failed recovery probability in a distributed wireless storage system with limited sum storage capacity2014
- When queueing meets coding: Optimal-latency data retrieving scheme in storage clouds2014
- Coding for fast content download2012
- Distributed Storage AllocationsIEEE Transactions on Information Theory, 2012
- Distributed storage allocations for optimal delay2011
- Network Coding for Distributed Storage SystemsIEEE Transactions on Information Theory, 2010
- Memory allocation in distributed storage networks2010