• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computational Science - ICCS 2003 Pt.3 Jun 2-4, 2003 Melbourne, Australia and St. Petersburg, Russia >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 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号