An Optimized Round-Robin Scheduling of Speakers for Peers-to-Peers-Based Byzantine Faulty Tolerance
- Publication Type:
- Conference Proceeding
- 2018 IEEE Globecom Workshops, GC Wkshps 2018 - Proceedings, 2019
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is currently unavailable due to the publisher's embargo.
The embargo period expires on 19 Dec 2020
© 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: