Proof-of-QoS: QoS based blockchain consensus protocol

被引：36
作者：
Yu, Bin [1 ,2 ]
Liu, Joseph [3 ]
Nepal, Surya [2 ]
Yu, Jiangshan [1 ]
Rimba, Paul [4 ]
机构：
[1] Monash Univ, Clayton, Vic, Australia
[2] CSIRO, DATA61, Canberra, ACT, Australia
[3] Monash Univ, Fac Informat Technol, Clayton, Vic, Australia
[4] CSIRO, Software & Computat Syst Grp, Data61, Canberra, ACT, Australia
来源：
COMPUTERS & SECURITY | 2019年 / 87卷
关键词：
Blockchain; Consensus protocol; BFT; Quality of service; Proof-of-QoS (PoQ);
D O I：
10.1016/j.cose.2019.101580
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The consensus protocol is the foundation of all blockchain systems. Existing consensus protocols like Proof-of-Work (PoW) consume a vast amount of energy. However, they are severely limited to transaction throughput. Consensus protocols like Proof-of-Stake (PoS) have been proposed to address this challenge. However, these protocols have compromised the fairness by discouraging the "poorer" participants and allowing "richest" stakeholders to have full control over the generation of blocks. Towards meeting these conflicting requirements on throughput and fairness, we propose a blockchain consensus protocol based on the Quality-of-Service (QoS). In our Proof-of-QoS (PoQ) protocol, the entire network is divided into small regions. Each region nominates a node based on its QoS. A deterministic Byzantine Fault Tolerance (BFT) consensus is then run among all nominated nodes. PoQ aims to achieve a very high transaction throughput as a permissionless protocol and provides a fairer environment for participants. Our experimental results show that PoQ can achieve 9.7K transactions per second (TPS) for a network of 12 regions. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数：13
相关论文
共 20 条
  • [11] Gudgeon L, 2019, 2019360 CRYPT EPR AR
  • [12] Heilman E, 2015, PROCEEDINGS OF THE 24TH USENIX SECURITY SYMPOSIUM, P129
  • [13] Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol
    Kiayias, Aggelos
    Russell, Alexander
    David, Bernardo
    Oliynykov, Roman
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PT I, 2017, 10401 : 357 - 388
  • [14] The part-time parliament
    Lamport, L
    [J]. ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1998, 16 (02): : 133 - 169
  • [15] Malkhi D., 1997, DISTRIB COMPUT, P203
  • [16] Nelson M., 2018, SURVEY NTP NETWORK
  • [17] Sompolinsky Y., 2016, Rep. 2016/1159, P1159
  • [18] Secure High-Rate Transaction Processing in Bitcoin
    Sompolinsky, Yonatan
    Zohar, Aviv
    [J]. FINANCIAL CRYPTOGRAPHY AND DATA SECURITY (FC 2015), 2015, 8975 : 507 - 527
  • [19] NASH EQUILIBRIUM WITH STRATEGIC COMPLEMENTARITIES
    VIVES, X
    [J]. JOURNAL OF MATHEMATICAL ECONOMICS, 1990, 19 (03) : 305 - 321
  • [20] Yu J., 2018, 2018239 CRYPT EPR AR
12