ORIC: A Self-Adjusting Blockchain Protocol with High Throughput

被引:3
|
作者
Xiong, Ting [1 ]
Xie, Tao [1 ]
Xie, Jin [2 ]
Luo, Xiaochun [3 ]
机构
[1] Natl Univ Def Technol, Changsha, Hunan, Peoples R China
[2] Peking Univ, Beijing, Peoples R China
[3] PLA News Media Ctr, Beijing, Peoples R China
基金
美国国家科学基金会;
关键词
blockchain; consensus protocol; throughput self-adjusting; evaluation;
D O I
10.1109/ISPA-BDCloud-SocialCom-SustainCom52081.2021.00193
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a simple and self-adjusting blockchain protocol called ORIC to make full use of the available bandwidth as far as possible. ORIC follows the Nakamoto protocol and allows many more blocks to be produced during the block-time so that the bandwidth can be exploited to its maximum extent. Recorded blocks are organized into a Directed Acyclic Graph(DAG) sequence from which a transaction total order can be deterministically derived as the blockchain ledger. We give a theoretical analysis of ORIC's properties, such as security and liveness, and evaluate its performance on a distributed system simulator with 1000 full nodes designed. The simulation shows that ORIC can achieve bandwidth utilization close to 50% while confirming transactions in 5-7 minutes under the bandwidth of 20Mbps available. More importantly, our protocol can achieve an optimal throughput by a self-adjusting mechanism when the available bandwidth changes in a peer-to-peer network while hardly affecting security.
引用
收藏
页码:1422 / 1434
页数:13
相关论文
共 50 条
  • [41] SELF-ADJUSTING MALTESE MECHANISMS.
    Nadezhdin, I.V.
    Izvestia vyssih ucebnyh zavedenij. Masinostroenie, 1987, (07): : 49 - 53
  • [42] Toward Optimal Self-Adjusting Heaps
    Elmasry, Amr
    ACM TRANSACTIONS ON ALGORITHMS, 2017, 13 (04)
  • [43] A SELF-ADJUSTING DYNAMIC LOGIC MODULE
    MARTINEZ, TR
    CAMPBELL, DM
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 11 (04) : 303 - 313
  • [44] Compiling Self-Adjusting Programs with Continuations
    Ley-Wild, Ruy
    Fluet, Matthew
    Acar, Umut A.
    ICFP'08: PROCEEDINGS OF THE 2008 SIGPLAN INTERNATIONAL CONFERENCE ON FUNCTIONAL PROGRAMMING, 2008, : 321 - 333
  • [45] Distributed Self-Adjusting Tree Networks
    Peres, Bruna Soares
    Souza, Otavio Augusto de Oliveira
    Goussevskaia, Olga
    Avin, Chen
    Schmid, Stefan
    IEEE TRANSACTIONS ON CLOUD COMPUTING, 2023, 11 (01) : 716 - 729
  • [46] SYNTHESIS OF COMPUTATIONAL SELF-ADJUSTING SYSTEMS
    SOLODOVN.VV
    SEMENOV, VV
    ENGINEERING CYBERNETICS, 1965, (02): : 102 - &
  • [47] A SELF-ADJUSTING ALGORITHM FOR BYZANTINE AGREEMENT
    ZHAO, Y
    BASTANI, FB
    DISTRIBUTED COMPUTING, 1992, 5 (04) : 219 - 226
  • [48] A consistent semantics of self-adjusting computation
    Acar, Umut A.
    Blume, Matthias
    Donham, Jacob
    JOURNAL OF FUNCTIONAL PROGRAMMING, 2013, 23 (03) : 249 - 292
  • [49] Memory Management for Self-Adjusting Computation
    Hammer, Matthew A.
    Acar, Umut A.
    ISMM'08: PROCEEDINGS OF THE 2008 INTERNATIONAL SYMPOSIUM ON MEMORY MANAGEMENT, 2008, : 51 - 60
  • [50] An Experimental Analysis of Self-Adjusting Computation
    Acar, Umut A.
    Blelloch, Guy E.
    Blume, Matthias
    Harper, Robert
    Tangwongsan, Kanat
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2009, 32 (01):