.png){kind=icon}
返回
Scalable and leaderless Byzantine consensus in cloud computing environments
.png){kind=icon}
PRE
AI
DOI：10.1007/s10796-013-9460-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Traditional Byzantine consensus in distributed systems requires n a parts per thousand yen 3f + 1, where n is the number of nodes. In this paper, we present a scalable and leaderless Byzantine consensus implementation based on gossip, requiring only n a parts per thousand yen 2f + 1 nodes. Unlike conventional distributed systems, the network topology of cloud computing systems is often not fully connected, but loosely coupled and layered. Hence, we revisit the Byzantine consensus problem in cloud computing environments, in which each node maintains some number of neighbors, called local view. The message complexity of our Byzantine consensus scheme is O(n), instead of O(n (2)). Experimental results and correctness proof show that our Byzantine consensus scheme can solve the Byzantine consensus problem safely in a scalable way without a bottleneck and a leader in cloud computing environments.
Keyword:
Byzantine fault tolerance
Consensus
Gossip
Cloud computing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
2.0K
被引数:
6.5K
机构
引用论文
分享收藏Biologically Active Components from Mycobacterial Cell Walls. I. Isolation and Composition of Cell Wall Skeleton and Component P
3分枝杆菌细胞壁的生物活性成分。一、细胞壁骨架和组分P的隔离和组成
三
PREAI
分享收藏On the pros and cons of using temporal derivatives to assess brain functional connectivity.png)
NeuroImage
OAAI
NeuroImageIF0
OAAI分享收藏Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility云计算和新兴IT平台: 将计算作为第五种实用工具交付的愿景、炒作和现实
PREAI
分享收藏
查看更多内容