arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.5786cs.ITmath.IT
收藏

用于复制和编码存储系统的交叉网络模型

Queued cross-bar network models for replication and coded storage systems

Ulric J. Ferner, Neda Aboutorab, Parastoo Sadeghi, Muriel Medard

摘要:

编码技术对于数据中心数据生存性以及减少业务拥塞可能是有用的。我们提出了一种排队交叉网络(QCN)的方法,可用于复制/未编码和编码的存储系统的流量分析。我们开发了一个框架,通过分析它们的冲突图稳定集多面体(SSP)生成QCN率区域(RR)。在这样做的时候,我们应用最近的结果从图论的特定图形SSP的特征。我们的特征SSP的QCN冲突图下的各种流量模式,允许其有效的RR计算。对于未编码的系统,我们将展示如何计算RR和找到速率最优调度算法。对于编码存储,我们开发了一个RR上限,我们提供了一个直观的解释。我们表明,编码存储RR上界是可以实现的,在某些编码系统中,驱动器存储足够的编码信息,以及在某些动态编码系统。数值例子表明,编码存储可以导致约50%的RR量的增益,平均跨交通模式。

英文摘要:

Coding techniques may be useful for data center data survivability as well as for reducing traffic congestion. We present a queued cross-bar network (QCN) method that can be used for traffic analysis of both replication/uncoded and coded storage systems. We develop a framework for generating QCN rate regions (RRs) by analyzing their conflict graph stable set polytopes (SSPs). In doing so, we apply recent results from graph theory on the characterization of particular graph SSPs. We characterize the SSP of QCN conflict graphs under a variety of traffic patterns, allowing for their efficient RR computation. For uncoded systems, we show how to compute RRs and find rate optimal scheduling algorithms. For coded storage, we develop a RR upper bound, for which we provide an intuitive interpretation. We show that the coded storage RR upper bound is achievable in certain coded systems in which drives store sufficient coded information, as well in certain dynamic coding systems. Numerical illustrations show that coded storage can result in gains in RR volume of approximately 50%, averaged across traffic patterns.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑