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 条

[1] [Anonymous], 2008, WORKING PAPER
[2] BENTOV I, 2016, IACR CRYPTOLOGY EPRI, V2016
[3] Bentov I., 2017, IACR CRYPTOLOGY EPRI
[4] Cachin C., 2001, Advances in Cryptology - CRTPTO 2001. 21st Annual International Cryptology Conference, Proceedings (Lecture Notes in Computer Science Vol.2139), P524
[5] Practical byzantine fault tolerance and proactive recovery
Castro, M
Liskov, B
[J]. ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2002, 20 (04): : 398 - 461
[6] Clark J, 2015, RES PERSPECTIVES CHA
[7] On Scaling Decentralized Blockchains (A Position Paper)
Croman, Kyle
Decker, Christian
Eyal, Ittay
Gencer, Adem Efe
Juels, Ari
Kosba, Ahmed
Miller, Andrew
Saxena, Prateek
Shi, Elaine
Sirer, Emin Gun
Song, Dawn
Wattenhofer, Roger
[J]. FINANCIAL CRYPTOGRAPHY AND DATA SECURITY, FC 2016, 2016, 9604 : 106 - 125
[8] David B.M., 2017, IACR CRYPTOLOGY EPRI, V2017, P573
[9] The Sybil attack
Douceur, JR
[J]. PEER-TO-PEER SYSTEMS, 2002, 2429 : 251 - 260
[10] Algorand: Scaling Byzantine Agreements for Cryptocurrencies
Gilad, Yossi
Hemo, Rotem
Micali, Silvio
Vlachos, Georgios
Zeldovich, Nickolai
[J]. PROCEEDINGS OF THE TWENTY-SIXTH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES (SOSP '17), 2017, : 51 - 68

← 1 2 →