首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >On the Synchronization Bottleneck of OpenStack Swift-Like Cloud Storage Systems
【24h】

On the Synchronization Bottleneck of OpenStack Swift-Like Cloud Storage Systems

机译:OpenStack Swift类似云存储系统的同步瓶颈

获取原文
获取原文并翻译 | 示例
           

摘要

As one type of the most popular cloud storage services, OpenStack Swift and its follow-up systems replicate each object across multiple storage nodes and leverage object sync protocols to achieve high reliability and eventual consistency. The performance of object sync protocols heavily relies on two key parameters: r (number of replicas for each object) and n (number of objects hosted by each storage node). In existing tutorials and demos, the configurations are usually r = 3 and n <; 1;000 by default, and the sync process seems to perform well. However, we discover in data-intensive scenarios, e.g., when r > 3 and n <; 1;000, the sync process is significantly delayed and produces massive network overhead, referred to as the sync bottleneck problem. By reviewing the source code of OpenStack Swift, we find that its object sync protocol utilizes a fairly simple and network-intensive approach to check the consistency among replicas of objects. Hence in a sync round, the number of exchanged hash values per node is Θ(n × r). To tackle the problem, we propose a lightweight and practical object sync protocol, LightSync, which not only remarkably reduces the sync overhead, but also preserves high reliability and eventual consistency. LightSync derives this capability from three novel building blocks: 1) Hashing of Hashes, which aggregates all the h hash values of each data partition into a single but representative hash value with the Merkle tree; 2) Circular Hash Checking, which checks the consistency of different partition replicas by only sending the aggregated hash value to the clockwise neighbor; and 3) Failed Neighbor Handling, which properly detects and handles node failures with moderate overhead to effectively strengthen the robustness of LightSync. The design of LightSync offers provable guarantee on reducing the per-node network overhead from Θ(n × r) to Q(nh). Furthermore, we have implemented LightSync as an open-source patch and adopted it to OpenStack Swift, thus reducing the sync delay by up to 879× and the network overhead by up to 47.5×.
机译:作为最流行的云存储服务的一种,OpenStack Swift及其后续系统跨多个存储节点复制每个对象,并利用对象同步协议来实现高可靠性和最终的一致性。对象同步协议的性能在很大程度上取决于两个关键参数:r(每个对象的副本数)和n(每个存储节点托管的对象数)。在现有的教程和演示中,配置​​通常为r = 3和n <;。默认值为1; 000,并且同步过程似乎运行良好。但是,我们发现在数据密集型方案中,例如,当r> 3且n <; 1; 000会大大延迟同步过程,并产生大量的网络开销,称为同步瓶颈问题。通过查看OpenStack Swift的源代码,我们发现其对象同步协议利用相当简单且占用大量网络资源的方法来检查对象副本之间的一致性。因此,在同步回合中,每个节点交换的哈希值的数量为Θ(n×r)。为了解决这个问题,我们提出了一种轻巧实用的对象同步协议LightSync,该协议不仅显着减少了同步开销,而且还保留了高可靠性和最终的一致性。 LightSync从三个新颖的构建块中获得了此功能:1)哈希散列,它通过Merkle树将每个数据分区的所有h散列值聚合为单个但有代表性的散列值; 2)循环哈希检查,通过仅将合计哈希值发送到顺时针邻居来检查不同分区副本的一致性;和3)失败的邻居处理,以适当的开销正确地检测和处理节点故障,以有效增强LightSync的鲁棒性。 LightSync的设计为将每个节点的网络开销从Θ(n×r)减少到Q(nh)提供了可证明的保证。此外,我们已将LightSync实施为开源补丁并将其用于OpenStack Swift,从而将同步延迟降低了879倍,将网络开销降低了47.5倍。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号