.png){kind=icon}
返回
Allocation for Heterogeneous Storage Nodes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2015.2496235.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Storage allocation, meaning the way that a chunk of data is stored over a set of storage nodes, affects different performance measures of a distributed storage system (DSS). In this work, we study the storage allocation problem for a DSS where nodes have different storage capacities. To this end, we first introduce the notion of k-guaranteed allocations referring to allocations where the data can be recovered by accessing any arbitrary set of k storage nodes. We then find the necessary conditions for an allocation to be k-guaranteed considering the limit on the individual node capacities and the overall storage budget. Using these conditions, an iterative algorithm is developed to find k-guaranteed allocations, if feasible.
Keyword:
Distributed storage systems
storage allocation
heterogeneous storage capacities
期刊
IF:
4.4
论文数:
1.3W
被引数:
2.2W
机构
引用论文
.png){kind=icon}
分享收藏 没有更多内容
没有更多内容