GDSP：分布式存储系统的图形透视
GDSP: A Graphical Perspective on the Distributed Storage Systems
摘要：
经典的分布式存储问题可以用一个k-一致{ \it complete}超图来建模，其中顶点表示服务器，超边表示用户.因此，每个超边缘应该能够恢复完整的文件只使用与之相关的顶点的记忆。本文认为这个问题的推广{ \it任意}超图和多个文件的情况下，每个用户只感兴趣的一个，我们将称为图形分布式存储问题（GDSP）的问题。具体而言，我们取得的进展，在分析的最小存储代码的两个主要的子问题的GDSP扩展的经典模型在两个独立的方向：的情况下，任意图与多个文件，和一个任意的超图与一个文件。
英文摘要：
The classical distributed storage problem can be modeled by a k-uniform {\it complete} hyper-graph where vertices represent servers and hyper-edges represent users. Hence each hyper-edge should be able to recover the full file using only the memories of the vertices associated with it. This paper considers the generalization of this problem to {\it arbitrary} hyper-graphs and to the case of multiple files, where each user is only interested in one, a problem we will refer to as the graphical distributed storage problem (GDSP). Specifically, we make progress in the analysis of minimum-storage codes for two main subproblems of the GDSP which extend the classical model in two independent directions: the case of an arbitrary graph with multiple files, and the case of an arbitrary hyper-graph with a single file.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
