首页> 外文会议>International conference on computational science >Symmetric Tree Replication Protocol for Efficient Distributed Storage System
【24h】

Symmetric Tree Replication Protocol for Efficient Distributed Storage System

机译:用于高效分布式存储系统的对称树复制协议

获取原文

摘要

In large distributed systems, replication of data and service is needed to decrease the communication cost, increase the overall availability, avoid single server bottleneck, and increase the reliability. Tree quorum protocol is one of the replication protocols allowing very low read cost in the best case but has some drawbacks such that the number of replicas grows rapidly as the level increases and root replica becomes a bottleneck. In this paper we propose a new replication protocol called symmetric tree protocol which efficiently solves the problems. The proposed symmetric tree protocol also requires much smaller read cost than the previous protocols. We conduct cost and availability analysis of the protocols, and the proposed protocol displays comparable read availability to the tree protocol using much smaller number of nodes. It is thus effective to be applied to survival storage system.
机译:在大型分布式系统中,需要复制数据和服务来降低通信成本,提高整体可用性,避免单服务器瓶颈,并提高可靠性。树仲裁协议是在最佳情况下允许非常低的读取成本的复制协议之一,但具有一些缺点,使得副本的数量快速增长,因为水平增加并且根副本成为瓶颈。在本文中,我们提出了一种称为对称树协议的新复制协议,其有效解决了问题。所提出的对称树协议还需要比先前协议更小的读取成本。我们对协议进行成本和可用性分析,并且所提出的协议使用大量节点显示树协议的可比读取可用性。因此,它有效地应用于存活储存系统。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号