We consider a distributed storage system which stores several hot (popular) and cold (less popular) data files across multiple nodes or servers. Hot files are stored using repetition codes while cold files are stored using erasure codes. The nodes are prone to failure and hence at any given time, we assume that only a fraction of the nodes are available. Using a cavity process based mean field framework, we analyze the download time for users accessing hot or cold data in the presence of failed nodes. Our work also illustrates the impact of the choice of the storage code on the download time performance of users in the system.

中文翻译：

---

节点故障的分布式存储系统的下载时间分析

我们考虑一个分布式存储系统，该系统跨多个节点或服务器存储多个热（受欢迎的）和冷的（不太受欢迎的）数据文件。使用重复代码存储热文件，而使用擦除代码存储冷文件。这些节点很容易发生故障，因此在任何给定时间，我们都假定只有一小部分节点可用。使用基于腔过程的均值场框架，我们分析了存在故障节点时用户访问热数据或冷数据的下载时间。我们的工作还说明了选择存储代码对系统中用户下载时间性能的影响。