Service Rate Region of Content Access from Erasure Coded Storage
Service Rate Region of Content Access from Erasure Coded Storage
复制标题
DOI：
10.1109/itw.2018.8613504
复制
发表时间：
2018-11
期刊：
影响因子：
--
通讯作者：
S. Anderson;A. Johnston;Gauri Joshi;Gretchen L. Matthews;Carolyn Mayer;E. Soljanin
中科院分区：
文献类型：
--
作者：
S. Anderson;A. Johnston;Gauri Joshi;Gretchen L. Matthews;Carolyn Mayer;E. Soljanin
我们考虑$ k $文件在$ n $节点上存储的存储系统。从某种意义上说，该节点可能是系统的，因为它可以访问其对文件的访问。另外，可以对节点进行编码，这意味着仅在与其他节点结合时（可以编码或系统的）才能访问特定文件。文件$ f_ {k} $的请求以$ \ lambda _ {k} $的价格获得，我们对特定系统可以提供的费率感兴趣。在本文中，我们确定了3条文件编码存储系统的请求到达率集。我们还提供了一种算法来最大化给定$ \ lambda _ {1} $，...，$ \ lambda _ {k-1} $的文件$ k $提供的请求率。
We consider storage systems in which $K$ files are stored over $N$ nodes. A node may be systematic for a particular file in the sense that access to it gives access to the file. Alternatively, a node may be coded, meaning that it gives access to a particular file only when combined with other nodes (which may be coded or systematic). Requests for file $f_{k}$ arrive at rate $\lambda _{k}$, and we are interested in the rate that can be served by a particular system. In this paper, we determine the set of request arrival rates for the a 3-file coded storage system. We also provide an algorithm to maximize the rate of requests served for file $K$ given $\lambda _{1}$,..., $\lambda _{K-1}$ in a general K-file case.