An Optimized Round-Robin Scheduling of Speakers for Peers-to-Peers-Based Byzantine Faulty Tolerance

Yu, G; Wang, X; Zha, X; Zhang, JA; Liu, RP

An Optimized Round-Robin Scheduling of Speakers for Peers-to-Peers-Based Byzantine Faulty Tolerance

Yu, G Wang, X

Zha, X Zhang, JA

Liu, RP

Permalink

Publication Type:: Conference Proceeding
Citation:: 2018 IEEE Globecom Workshops, GC Wkshps 2018 - Proceedings, 2019
Issue Date:: 2019-02-19

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted ManuscriptAdobe PDF (375.08 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Yu, G	en_US
dc.contributor.author	Wang, X https://orcid.org/0000-0001-9439-6437	en_US
dc.contributor.author	Zha, X	en_US
dc.contributor.author	Zhang, JA https://orcid.org/0000-0002-6102-3762	en_US
dc.contributor.author	Liu, RP https://orcid.org/0000-0001-7001-6305	en_US
dc.date.available	2020-12-19T18:07:23Z
dc.date.issued	2019-02-19	en_US
dc.identifier.citation	2018 IEEE Globecom Workshops, GC Wkshps 2018 - Proceedings, 2019	en_US
dc.identifier.isbn	9781538649206	en_US
dc.identifier.uri	http://hdl.handle.net/10453/132317
dc.description.abstract	© 2018 IEEE. Blockchain technology has been showing its strong performance on decentralized security when integrating with Internet of Things network. However, the trilemma of scalability-security-decentralization exists in Blockchain-based IoT. Therein the typical round-robin scheduling implemented in the Byzantine Faulty Tolerance (BFT) proposed by Neo's Blockchain has a significant delay when consecutive faulty miners exist. This paper proposes a novel analysis model for evaluating the network performance collapse in general, followed by an optimized round-robin scheduling for the case when the mutual latency difference is not significant enough for ranking. Based on the model, the optimized mechanism is able to increase the block rate for a specific subset of consecutive faulty miners by nearly 50% and provide a linearly positive growth rate of the mitigation with respect to the fail rate of a single miner, which strongly promotes the efficiency of the P2P-based BFT consensus algorithm.	en_US
dc.relation.ispartof	2018 IEEE Globecom Workshops, GC Wkshps 2018 - Proceedings	en_US
dc.relation.isbasedon	10.1109/GLOCOMW.2018.8644251	en_US
dc.rights	info:eu-repo/semantics/openAccess
dc.title	An Optimized Round-Robin Scheduling of Speakers for Peers-to-Peers-Based Byzantine Faulty Tolerance	en_US
dc.type	Conference Proceeding
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	open_access	*
pubs.publication-status	Published	en_US

Abstract:

© 2018 IEEE. Blockchain technology has been showing its strong performance on decentralized security when integrating with Internet of Things network. However, the trilemma of scalability-security-decentralization exists in Blockchain-based IoT. Therein the typical round-robin scheduling implemented in the Byzantine Faulty Tolerance (BFT) proposed by Neo's Blockchain has a significant delay when consecutive faulty miners exist. This paper proposes a novel analysis model for evaluating the network performance collapse in general, followed by an optimized round-robin scheduling for the case when the mutual latency difference is not significant enough for ranking. Based on the model, the optimized mechanism is able to increase the block rate for a specific subset of consecutive faulty miners by nearly 50% and provide a linearly positive growth rate of the mitigation with respect to the fail rate of a single miner, which strongly promotes the efficiency of the P2P-based BFT consensus algorithm.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/132317