• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Latency Analysis for Distributed Coded Storage Systems
【24h】

Latency Analysis for Distributed Coded Storage Systems

机译：分布式编码存储系统的延迟分析

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Modern communication and computation systems often consist of large networks of unreliable nodes. Still, it is well known that such systems can provide aggregate reliability via redundancy. While duplication may increase the load on a system, it can lead to significant performance improvement when combined with the judicious management of extra system resources. Prime examples of this abstract paradigm include multi-path routing across communication networks, content access from multiple caches in delivery networks, and master/slave computations on compute clusters. Several recent contributions in the area establish bounds on the performance of redundant systems, characterizing the latency-redundancy tradeoff under specific load profiles. Following a similar line of research, this paper introduces new analytical bounds and approximation techniques for the latency-redundancy tradeoff for a range of system loads and a class of symmetric redundancy schemes, under the assumption of Poisson arrivals, exponential service-rates, and fork-join scheduling policy. The proposed approach can be employed to efficiently approximate the latency distribution of a queueing system at equilibrium. Various metrics can subsequently be derived for this system, including the mean and variance of the sojourn time, and the tail decay rate of the stationary distribution. This paper also establishes the stability region in terms of arrival rates for redundant systems with certain symmetries. Finally, it offers selection guidelines for design parameters to provide latency guarantees based on the proposed approximations. Findings are substantiated by numerical results.
机译：现代通信和计算系统通常由不可靠节点的大型网络组成。仍然众所周知，这样的系统可以通过冗余来提供合计的可靠性。尽管重复操作可能会增加系统的负载，但与明智的额外系统资源管理相结合，则可以显着提高性能。这种抽象范式的主要示例包括跨通信网络的多路径路由，来自传递网络中多个缓存的内容访问以及计算群集上的主/从计算。该领域最近的一些贡献为冗余系统的性能设定了界限，表征了在特定负载曲线下的等待时间-冗余权衡。经过类似的研究，本文介绍了在泊松到达，指数服务速率和分叉的假设下，针对一系列系统负载和一类对称冗余方案的延迟冗余权衡的新分析界线和近似技术。 -加入调度策略。可以采用所提出的方法来有效地估计处于平衡状态的排队系统的等待时间分布。随后可以为该系统导出各种度量，包括停留时间的均值和方差以及平稳分布的尾部衰减率。本文还根据具有一定对称性的冗余系统的到达率建立了稳定区域。最后，它提供了设计参数的选择指南，以基于提议的近似值提供延迟保证。结果由数字结果证实。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号