Design of tree topology based Byzantine fault tolerance system

Wei-dong LYU; Xue-guang ZHOU; Zhi-min YUAN

doi:10.11959/j.issn.1000-436x.2017261

您当前的位置：

首页 >

文章列表页 >

Design of tree topology based Byzantine fault tolerance system

Papers | 更新时间：2024-06-05

- Design of tree topology based Byzantine fault tolerance system
- Journal on Communications Vol. 38, Issue Z2, Pages: 139-146(2017)
- 作者机构：
  
  海军工程大学信息安全系，湖北武汉430033
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(61672531);The Scientific Research Project of Naval University of Engineering(20161606)
- DOI：10.11959/j.issn.1000-436x.2017261
  CLC： TP302
- Online First：2017-11，
  
  Published：25 November 2017
- 稿件说明：
移动端阅览
Wei-dong LYU, Xue-guang ZHOU, Zhi-min YUAN. Design of tree topology based Byzantine fault tolerance system[J]. Journal on Communications, 2017, 38(Z2): 139-146.
DOI：

Wei-dong LYU, Xue-guang ZHOU, Zhi-min YUAN. Design of tree topology based Byzantine fault tolerance system[J]. Journal on Communications, 2017, 38(Z2): 139-146. DOI： 10.11959/j.issn.1000-436x.2017261.

摘要

提出了一种能够应用于树形结构的拜占庭容错系统，并给出了基于深度与广度的拜占庭节点上限算法。通过对树进行群组划分，设计了一致性协议，保障了系统的安全性；通过联合签名机制决定节点的权限；通过视图转换协议将高层拜占庭节点置换到叶子节点，保证了系统的活性。在传统协议的基础上，该系统支持多任务同时执行，减少了节点间通信量，较大地降低了系统的空间复杂度，提高了系统的可行性，进一步缩小了与非拜占庭系统的差距。

Abstract

A tree topology based Byzantine fault tolerance system was designed and the calculation of the Byzantine node bound based on depth and width was given.The consistency protocol was designed through divide the tree into groups by communication and work

which guaranteed the safety of system.The access of a node was determined with joint signature mechanism.The Byzantine nodes were placed to the leaves by view change protocol

which guaranteed the liveness of the system.On the foundation of traditional protocol

the new protocol support multiple tasks operating at the same time

and communication between nodes is largely decreased

as well as the space complexity

hence the feasibility being promoted

and the gap between Byzantine fault tolerance system and the non-Byzantine systems being narrowed.

关键词

Keywords

references

SCHROEDER B , GIBSON G A . A large-scale study of failures in high-performance computing systems [C ] // IEEE Trans on Dependable and Secure Computing . 2010 : 337 - 350 .

范捷 , 易乐天 , 舒继武 . 拜占庭系统技术研究综述 [J ] . 软件学报 , 2013 , 24 ( 6 ): 1346 - 1360 .

FAN J , YI L T , SHU J W . Research on the technology of Byzantine system [J ] . Journal of Software , 2013 , 24 ( 60 ): 1346 - 1360 .

袁勇 , 王飞跃 . 区块链技术发展现状与展望 [J ] . 自动化学报 , 2016 , 42 ( 4 ): 481 - 493 .

YUAN Y , WANG F Y . Blockchain:the state of the art and future trends [J ] . Acta Automatic Sinica , 2016 , 42 ( 4 ): 481 - 494 .

夏清 , 张凤军 , 左春 . 加密数字货币系统共识机制综述 [J ] . 计算机系统应用 , 2017 , 26 ( 4 ): 1 - 8 .

XIA Q , ZHANG F J , ZUO C . Review for consensus mechanism of cryptocurrency system [J ] . Computer Science ＆ Application , 2017 , 26 ( 4 ): 1 - 8 .

LISKOV B , GHEMAWAT S , GRUBER R , et al . Replication in the harp file system [C ] // 13th ACM Symp on Operating System Principles(SOSP) . 1991 : 226 - 238 .

OKI B , LISKOV B . Viewstamped replication:a new primary copy method to support highly-available distributed systems [C ] // ACM Symposium on Principles of Distributed Computing . 1988 : 8 - 17 .

LAMPORT L , SHOSTAK R , PEASE M . The Byzantine generals problem [C ] // ACM Trans . on Programming Languages and Systems , 1982 , 4 ( 3 ): 382 - 401 .

CASTRO M , LISKOV B . Practical Byzantine fault tolerance and proactive recovery [C ] // ACM Trans on Computer Systems . 2002 : 398 - 461

WOOD T , SINGH R , VENKATARAMANI A , et al . ZZ and the art of practical BFT execution [C ] // 6th Conf on Computer Systems . 2011 : 123 - 138 .

HENDRICKS J , SINNAMOHIDEEN S , GANGER G R , et al . Zzyzx:scalable fault tolerance through Byzantine locking [C ] // 2010 IEEE/IFIP Int’1 Conf on Dependable Systems and Networks . 2010 : 363 - 372 .

SERAFINI M , NOKOR P , DOBRE D , et al . Scrooge:Reducing the costs of fast Byzantine replication in presence of unresponsive replicas [C ] // 2010 IEEE/IFIP Int’1 Conf on Dependable Systems and Networks . 2010 : 353 - 362 .

RAMAKRISHNA K , LORENZO A , MIKE D , et al . Zyzzyva:speculative byzantine fault tolerance [C ] // ACM SIGOPS Symposium on Operating Systems Principles . 2007 : 45 - 48 .

CLEMENT A , KAPRITSOS M , LEE S , et al . Upright cluster services [C ] // ACM SIGOPS 22nd Symp on Operating Systems Principles . 2009 : 277 - 290 .

DANNY D . The Byzantine generals strike again [J ] . Journal of Algorithms , 1982 , 3 ( 1 ): 14 - 30 .

LAMPORT L , . Proving the correctness of multiprocess programs [C ] // IEEE Transactions on Software Engineering , 1977 , SE-3 ( 2 ): 125 - 143 .

Views

1396

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Byzantine fault-tolerant distributed access control mechanism for the Internet of things

Two-layer grouped Byzantine fault tolerance algorithm for UAV swarm

Related Author

CHAI Rong

AI Liping

YANG Ningyu

LIANG Chengchao

Yu CHEN

Lianxing JIA

Related Institution

School of Communications and Information Engineering, Chongqing University of Posts and Telecommunications

Chongqing Key Laboratory of Mobile Communication Technology

College of Information and Communication, National University of Defense Technology

AI问答

⁰