Download Time Analysis for Distributed Storage Codes With Locality and Availability

نویسندگان

چکیده

The paper presents techniques for analyzing the expected download time in distributed storage systems that employ systematic availability codes. These codes provide access to hot data through server containing object and multiple recovery groups. When a request an is received, it can be replicated (forked) all We first consider low-traffic regime present close-form expression time. By comparison across with availability, maximum distance separable (MDS), replication codes, we demonstrate reduce some settings but are not always optimal. In high-traffic regime, system contains inter-dependent Fork-Join queues, making exact analysis intractable. Accordingly, upper lower bounds on time, M/G/1 queue approximation several cases of interest. Via extensive numerical simulations, evaluate our has high degree accuracy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Regenerating Codes for Distributed Storage Systems

Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...

متن کامل

Bounds on Codes with Locality and Availability

In this paper we investigate bounds on rate and minimum distance of codes with t availability. We present bounds on minimum distance of code with t availability that are tighter than existing bounds. For bounds on rate of a code with t availability, we restrict ourself to a sub class of codes with t availability and derive a tighter rate bound. For t = 3, 4, we also present a high-rate construc...

متن کامل

Storage codes - Coding rate and repair locality

The repair locality of a distributed storage code is the maximum number of nodes that ever needs to be contacted during the repair of a failed node. Having small repair locality is desirable, since it is proportional to the number of disk accesses during repair. However, recent publications show that small repair locality comes with a penalty in terms of code distance or storage overhead if exa...

متن کامل

Subspace Codes and Distributed Storage Codes

1 Abbreviations and Notations 2 A Note for the Reader 3

متن کامل

Regenerating Codes and Locally Recoverable Codes for Distributed Storage Systems

We survey the recent results on applying error control coding to distributed storage systems. In such systems, errors often happen in a burst manner, or maybe only one storage node in the whole distributed system fails. Therefore, only a small amount of information, e.g., one data fragment, has to be recovered. Therefore, accessing the whole data is unnecessary. Especially, we focus on regenera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Communications

سال: 2021

ISSN: ['1558-0857', '0090-6778']

DOI: https://doi.org/10.1109/tcomm.2021.3067054