Proof-of-QoS

QoS based blockchain consensus protocol

Bin Yu, Joseph Liu, Surya Nepal, Jiangshan Yu, Paul Rimba

Research output: Contribution to journalArticleResearchpeer-review

Abstract

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.

Original languageEnglish
Article number101580
Number of pages13
JournalComputers & Security
Volume87
DOIs
Publication statusPublished - Nov 2019

Keywords

  • BFT
  • Blockchain
  • Consensus protocol
  • Proof-of-QoS (PoQ)
  • Quality of service

Cite this

@article{e38df698ce4c4c998f4e05a68a100c97,
title = "Proof-of-QoS: QoS based blockchain consensus protocol",
abstract = "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.",
keywords = "BFT, Blockchain, Consensus protocol, Proof-of-QoS (PoQ), Quality of service",
author = "Bin Yu and Joseph Liu and Surya Nepal and Jiangshan Yu and Paul Rimba",
year = "2019",
month = "11",
doi = "10.1016/j.cose.2019.101580",
language = "English",
volume = "87",
journal = "Computers & Security",
issn = "0167-4048",
publisher = "Elsevier",

}

Proof-of-QoS : QoS based blockchain consensus protocol. / Yu, Bin; Liu, Joseph; Nepal, Surya; Yu, Jiangshan; Rimba, Paul.

In: Computers & Security, Vol. 87, 101580, 11.2019.

Research output: Contribution to journalArticleResearchpeer-review

TY - JOUR

T1 - Proof-of-QoS

T2 - QoS based blockchain consensus protocol

AU - Yu, Bin

AU - Liu, Joseph

AU - Nepal, Surya

AU - Yu, Jiangshan

AU - Rimba, Paul

PY - 2019/11

Y1 - 2019/11

N2 - 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.

AB - 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.

KW - BFT

KW - Blockchain

KW - Consensus protocol

KW - Proof-of-QoS (PoQ)

KW - Quality of service

UR - http://www.scopus.com/inward/record.url?scp=85070279759&partnerID=8YFLogxK

U2 - 10.1016/j.cose.2019.101580

DO - 10.1016/j.cose.2019.101580

M3 - Article

VL - 87

JO - Computers & Security

JF - Computers & Security

SN - 0167-4048

M1 - 101580

ER -