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 条
  • [31] A DISCRETE SELF-ADJUSTING TRACKING SYSTEM
    KOSTYUK, VI
    ENGINEERING CYBERNETICS, 1966, (01): : 122 - &
  • [32] SEARCHLESS SELF-ADJUSTING IDENTIFICATION SYSTEMS
    ASHIMOV, A
    SYZDYKOV, DZ
    TOKHTABAEV, GM
    AUTOMATION AND REMOTE CONTROL, 1973, 34 (02) : 332 - 336
  • [33] Locally Self-Adjusting Tree Networks
    Avin, Chen
    Haeupler, Bernhard
    Lotker, Zvi
    Scheideler, Christian
    Schmid, Stefan
    IEEE 27TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2013), 2013, : 395 - 406
  • [34] Self-adjusting molds in continuous casters
    Kabinov, D.A.
    Litejnoe Proizvodstvo, 1998, (10): : 32 - 33
  • [35] A Cost Semantics for Self-Adjusting Computation
    Ley-Wild, Ruy
    Acar, Umut A.
    Fluet, Matthew
    ACM SIGPLAN NOTICES, 2009, 44 (01) : 186 - 199
  • [36] Self-adjusting mobility management strategy
    Zhu, Yi-Hua
    Gao, Ji
    Zhou, Gen-Gui
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2002, 39 (06):
  • [37] Locally Self-Adjusting Skip Graphs
    Huq, Sikder
    Ghosh, Sukumar
    2017 IEEE 37TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2017), 2017, : 805 - 815
  • [38] SELF-ADJUSTING HASH-TABLES
    PAGLI, L
    INFORMATION PROCESSING LETTERS, 1985, 21 (01) : 23 - 25
  • [39] TUBE DRAWING ON SELF-ADJUSTING MANDREL
    ERMANOK, MZ
    GANETS, FM
    SLAVIN, VB
    LEONTEV, YS
    DEMENSHI.VP
    POTOPAEV, AP
    STAL IN ENGLISH-USSR, 1965, (02): : 132 - &
  • [40] Compiling self-adjusting programs with continuations
    Ley-Wild, Ruy
    Fluet, Matthew
    Acar, Umut A.
    ACM SIGPLAN NOTICES, 2008, 43 (09) : 321 - 333