基于動態(tài)授權(quán)的拜占庭容錯共識算法的區(qū)塊鏈性能改進研究
發(fā)布時間：2018-11-13 19:48
【摘要】：隨著以比特幣為代表的數(shù)字貨幣的風(fēng)靡,區(qū)塊鏈作為其關(guān)鍵底層技術(shù)也越來越受各國政府和企業(yè)巨頭的關(guān)注。區(qū)塊鏈的去中心化、數(shù)據(jù)不可篡改性、動態(tài)靈活的體系特征,使得其在銀行、征信、金融等多領(lǐng)域應(yīng)用前景非常廣泛。但目前區(qū)塊鏈系統(tǒng)在交易吞吐量、時延等方面遠(yuǎn)遠(yuǎn)無法滿足大部分應(yīng)用場景的性能需求。以工作量證明(POW)、權(quán)益證明(POS)為主的公有區(qū)塊鏈的TPS只有7不到,一筆交易平均確認(rèn)時間為10分鐘,交易無法篡改的時間更是達到1小時;且POW、POS等共識算法效率低下,耗能嚴(yán)重,無法滿足區(qū)塊鏈系統(tǒng)性能需求;而Paxos、Raft為代表的傳統(tǒng)分布式一致性算法沒有考慮拜占庭容錯問題,同樣不適用于誠實與惡意節(jié)點共存的區(qū)塊鏈系統(tǒng);實用拜占庭容錯算法設(shè)計初衷是面向分布式系統(tǒng)消息、系統(tǒng)指令執(zhí)行順序問題而設(shè)計的的,采用的是C/S的架構(gòu),三階段的廣播協(xié)議嚴(yán)重浪費了帶寬,靜態(tài)的網(wǎng)絡(luò)拓?fù)浣Y(jié)構(gòu),無法符合區(qū)塊鏈動態(tài)對等的系統(tǒng)特征。本文在研究了以上共識算法的原理后,將DPOS算法的授權(quán)機制應(yīng)用到PBFT中,對PBFT加以改進,提出了適用于區(qū)塊鏈應(yīng)用的動態(tài)授權(quán)拜占庭容錯算法。DDBFT相比于PBFT具有以下三方面的優(yōu)勢:1)授權(quán)選舉機制,共識記賬節(jié)點專業(yè)化并輔以"升降級"機制,動態(tài)更新共識記賬代表2)精簡的共識狀態(tài),減少PBFT三階段共識廣播機制帶來的網(wǎng)絡(luò)開銷3)去C/S架構(gòu),純P2P網(wǎng)絡(luò)拓?fù)?完全符合區(qū)塊鏈系統(tǒng)特征最后,用Java程序設(shè)計并測試基于DDBFT的區(qū)塊鏈系統(tǒng)。實驗結(jié)果表明,該算法在最佳出塊時間20秒的時間間隔下,可以最大限度地利用網(wǎng)路帶寬,TPS可以達到10000-12000,時延控制在100-200ms之間,可以滿足絕大部分應(yīng)用系統(tǒng)的性能需求。
[Abstract]:With the popularity of digital currency represented by Bitcoin, block chain, as its key underlying technology, has attracted more and more attention from governments and corporate giants. The decentralization of block chain, the non-tampering of data, and the dynamic and flexible system feature make it widely used in many fields, such as banking, credit information, finance and so on. However, the current blockchain system can not meet the performance requirements of most application scenarios in terms of transaction throughput, delay and so on. The TPS of the public block chain whose (POW), rights and interests are mainly proved by the workload is less than 7, the average confirmation time of a transaction is 10 minutes, and the time that the transaction can not be tampered with is 1 hour. The consensus algorithms such as POW,POS are inefficient and energy-consuming, and can not meet the performance requirements of blockchain systems. The traditional distributed consistency algorithm represented by Paxos,Raft does not take Byzantine fault tolerance into account, nor is it suitable for block chain systems where honest and malicious nodes coexist. The practical Byzantine Fault-Tolerant algorithm was originally designed for distributed system message and system instruction execution order, and adopted the C / S architecture. The three-stage broadcast protocol seriously wasted bandwidth and static network topology. Unable to meet the block chain dynamic peer-to-peer system characteristics. After studying the principle of the above consensus algorithm, this paper applies the authorization mechanism of DPOS algorithm to PBFT, and improves PBFT. This paper proposes a dynamic authorization Byzantine fault-tolerant algorithm for block chain applications. Compared with PBFT, DDBFT has the following three advantages: 1) the mechanism of authorization election, the specialization of consensus accounting node and the mechanism of "upgrade and upgrade". Dynamic updating consensus bookkeeping represents 2) reduced consensus state, reducing network overhead brought by PBFT three-stage consensus broadcasting mechanism 3) removing C / S architecture, pure P2P network topology, completely consistent with block chain system characteristics. The block chain system based on DDBFT is designed and tested by Java program. Experimental results show that the proposed algorithm can make maximum use of the network bandwidth at the optimal time interval of 20 seconds. The TPS can reach 10000-12000, and the time delay is controlled between 100-200ms. It can meet the performance requirements of most application systems.
【學(xué)位授予單位】：浙江大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP311.13
本文編號：2330257
[Abstract]:With the popularity of digital currency represented by Bitcoin, block chain, as its key underlying technology, has attracted more and more attention from governments and corporate giants. The decentralization of block chain, the non-tampering of data, and the dynamic and flexible system feature make it widely used in many fields, such as banking, credit information, finance and so on. However, the current blockchain system can not meet the performance requirements of most application scenarios in terms of transaction throughput, delay and so on. The TPS of the public block chain whose (POW), rights and interests are mainly proved by the workload is less than 7, the average confirmation time of a transaction is 10 minutes, and the time that the transaction can not be tampered with is 1 hour. The consensus algorithms such as POW,POS are inefficient and energy-consuming, and can not meet the performance requirements of blockchain systems. The traditional distributed consistency algorithm represented by Paxos,Raft does not take Byzantine fault tolerance into account, nor is it suitable for block chain systems where honest and malicious nodes coexist. The practical Byzantine Fault-Tolerant algorithm was originally designed for distributed system message and system instruction execution order, and adopted the C / S architecture. The three-stage broadcast protocol seriously wasted bandwidth and static network topology. Unable to meet the block chain dynamic peer-to-peer system characteristics. After studying the principle of the above consensus algorithm, this paper applies the authorization mechanism of DPOS algorithm to PBFT, and improves PBFT. This paper proposes a dynamic authorization Byzantine fault-tolerant algorithm for block chain applications. Compared with PBFT, DDBFT has the following three advantages: 1) the mechanism of authorization election, the specialization of consensus accounting node and the mechanism of "upgrade and upgrade". Dynamic updating consensus bookkeeping represents 2) reduced consensus state, reducing network overhead brought by PBFT three-stage consensus broadcasting mechanism 3) removing C / S architecture, pure P2P network topology, completely consistent with block chain system characteristics. The block chain system based on DDBFT is designed and tested by Java program. Experimental results show that the proposed algorithm can make maximum use of the network bandwidth at the optimal time interval of 20 seconds. The TPS can reach 10000-12000, and the time delay is controlled between 100-200ms. It can meet the performance requirements of most application systems.
【學(xué)位授予單位】：浙江大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2017
【分類號】：TP311.13
【參考文獻】
相關(guān)期刊論文 前4條
1 張波;;國外區(qū)塊鏈技術(shù)的運用情況及相關(guān)啟示[J];金融科技時代;2016年05期
2 袁勇;王飛躍;;區(qū)塊鏈技術(shù)發(fā)展現(xiàn)狀與展望[J];自動化學(xué)報;2016年04期
3 唐文劍;;區(qū)塊鏈國內(nèi)外發(fā)展快速掃描[J];金融電子化;2016年03期
4 劉健;;利用PKI技術(shù)保障稅務(wù)網(wǎng)上申報系統(tǒng)的數(shù)據(jù)安全[J];信息網(wǎng)絡(luò)安全;2009年06期
，本文編號：2330257
本文鏈接：http://sikaile.net/kejilunwen/ruanjiangongchenglunwen/2330257.html
最近更新
教材專著
