论文标题
所需服务率区域的有效存储方案
Efficient Storage Schemes for Desired Service Rate Regions
论文作者
论文摘要
云/边缘存储系统的主要关注点是同时为大量用户提供服务。最近将服务率区域作为编码分布式系统的重要性能指标引入，该标准定义为系统可以同时处理的所有数据访问请求的集合。本文研究了设计一个编码的分布式存储系统，该问题存储了k文件，其中给出了系统的所需服务速率区域，并且目标是1）确定最少的存储节点n（r）（或n（r）上的下限），以在集合r和2中为所有需求vectors设计，以设计为有效的冗余方案，以较低的目标范围覆盖该范围，该范围较低的目标范围覆盖了该范围的一般范围。同样，对于k = 2，我们表征n（r），即，我们表明，通过设计具有N（r）存储节点的新型存储冗余方案和覆盖R的服务速率区域，提出的下限是紧密的。
A major concern in cloud/edge storage systems is serving a large number of users simultaneously. The service rate region is introduced recently as an important performance metric for coded distributed systems, which is defined as the set of all data access requests that can be simultaneously handled by the system. This paper studies the problem of designing a coded distributed storage system storing k files where a desired service rate region R of the system is given and the goal is 1) to determine the minimum number of storage nodes n(R) (or a lower bound on n(R)) for serving all demand vectors inside the set R and 2) to design the most storage-efficient redundancy scheme with the service rate region covering R. Towards this goal, we propose three general lower bounds for n(R). Also, for k=2, we characterize n(R), i.e., we show that the proposed lower bounds are tight via designing a novel storage-efficient redundancy scheme with n(R) storage nodes and the service rate region covering R.
