政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/141184

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/141184

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113318/144297 (79%)
Visitors : 51074806 Online Users : 946

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope

please add "double quotation mark" for query phrases to get precise results

please goto advance search for comprehansive author search

Adv. Search

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

Goto mobile version

政大典藏 > College of Informatics > Department of Computer Science > Theses > Item 140.119/141184

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/141184

Title:	以蒙地卡羅方法提升共識演算法效率 A Monte Carlo method to improve the efficiency of consensus algorithms
Authors:	黃清昱 Huang, Ching-Yu
Contributors:	郭桐惟 Kuo, Tung-Wei 黃清昱 Huang, Ching-Yu
Keywords:	共識演算法私有鏈 Consensus Algorithm Private Blockchain
Date:	2022
Issue Date:	2022-08-01 18:13:33 (UTC+8)
Abstract:	區塊鏈可視為一個能抵抗攻擊的分散式資料庫。為了維護所有節點的資料一致性，共識演算法在區塊鏈中扮演重要的角色。私有鏈經常使用PBFT和Raft這類基於訊息交換的共識演算法。節點進行訊息交換時，會設定等待訊息的時間上限，而這個時間上限往往成為此類演算法的效能瓶頸。因此，本論文提出了一個根據網路環境動態調整等待時間上限的演算法。實驗結果顯示我們的演算法可以提升私有鏈效能。 Blockchain is a distributed database system that is resistant to attack, and a consensus algorithm plays an important role in maintaining data consistency among all nodes in the blockchain. Private blockchains often rely on message exchange to reach consensus (e.g., by PBFT and Raft). When messages are exchanged among nodes, a timeout is set to upper bound the waiting time, and this timeout often causes performance bottleneck for consensus algorithms. In this thesis, we propose an algorithm to dynamically adjust the setting of the timeout. Experiment results show that our algorithm can improve the throughput of private blockchains.
Reference:	[1] T. T. A. Dinh, J. Wang, G. Chen, R. Liu, B. C. Ooi and K.-L. Tan, “Blockbench: A framework for analyzing private blockchains,” 於 Proceedings of the 2017 ACM international conference on management of data, 2017. [2] E. Buchman, “Tendermint: Byzantine fault tolerance in the age of blockchains,” University of Guelph, 2016. [3] Castro, Miguel, and Barbara Liskov, “Practical Byzantine fault tolerance and proactive recovery,” 於 ACM Transactions on Computer Systems (TOCS) 20.4, 2002. [4] J. A. Chacko, R. Mayer and H.-A. Jacobsen, “Why do my blockchain transactions fail? a study of hyperledger fabric,” 於 Proceedings of the 2021 International Conference on Management of Data, 2021. [5] J. Sousa, A. Bessani and M. Vukolic, “A byzantine fault-tolerant ordering service for the hyperledger fabric blockchain platform,” 於 2018 48th annual IEEE/IFIP international conference on dependable systems and networks (DSN) , 2018. [6] P. Thakkar, S. Nathan and B. Viswanathan, “Performance benchmarking and optimizing hyperledger fabric blockchain platform,” 於 2018 IEEE 26th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), 2018. [7] C. Gorenflo, S. Lee, L. Golab and S. Keshav, “FastFabric: Scaling hyperledger fabric to 20 000 transactions per second,” International Journal of Network Management , p. Vol. 30 Issue 5 Pages e2099, 2020. [8] L. Luu, V. Narayanan, C. Zheng, K. Baweja, S. Gilbert and P. Saxena, “A secure sharding protocol for open blockchains,” 於 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016. [9] M. Zamani, M. Movahedi and M. Raykova, “Rapidchain: Scaling blockchain via full sharding,” 於 Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018. [10] Y. Gilad, R. Hemo, S. Micali, G. Vlachos and N. Zeldovich, “Algorand: Scaling byzantine agreements for cryptocurrencies,” 於 Proceedings of the 26th symposium on operating systems principles, 2017. [11] L. Lamport, “Byzantizing Paxos by refinement,” 於 International symposium on distributed computing, 2011. [12] L. Lamport, “Paxos made simple,” ACM SIGACT News (Distributed Computing Column) 32, 4 (Whole Number 121, December 2001), pp. Pages 51-58, 2001. [13] D. Ongaro and J. Ousterhout, “The raft consensus algorithm,” 2015. [14] D. Ongaro and J. Ousterhout, “In search of an understandable consensus algorithm,” 於 2014 USENIX Annual Technical Conference (Usenix ATC 14), 2014. [15] C.-W. Chen, J.-W. Su, T.-W. Kuo and K. Chen, “MSig-BFT: A witness-based consensus algorithm for private blockchains,” 於 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS) , 2018. [16] Kuo, Tung-Wei, and Kung Chen, “No Need for Recovery: A Simple Two-Step Byzantine Consensus,” 於 arXiv preprint arXiv:1911.10361, 2019. [17] H. Moniz, “The Istanbul BFT consensus algorithm,” 於 arXiv preprint arXiv:2002.03613, 2020. [18] A. Miller, Y. Xia, K. Croman, E. Shi and D. Song, “The honey badger of BFT protocols,” 於 Proceedings of the 2016 ACM SIGSAC conference on computer and communications security , 2016. [19] Lu, Yuan, Zhenliang Lu, and Qiang Tang, “Bolt-dumbo transformer: Asynchronous consensus as fast as pipelined bft,” 於 arXiv preprint arXiv:2103.09425, 2021. [20] Poon, Joseph, and Thaddeus Dryja, “The bitcoin lightning network: Scalable off-chain instant payments,” 2016. [21] Coll Aumatell, Roger, “Analysis and development of blockchain rollups,” 於 MS thesis. Universitat Politècnica de Catalunya, 2021.
Description:	碩士國立政治大學資訊科學系 107753032
Source URI:	http://thesis.lib.nccu.edu.tw/record/#G0107753032
Data Type:	thesis
DOI:	10.6814/NCCU202200900
Appears in Collections:	[Department of Computer Science ] Theses

Files in This Item:

File	Description	Size	Format
303201.pdf		6874Kb	Adobe PDF2	0	View/Open

All items in 政大典藏 are protected by copyright, with all rights reserved.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - Feedback