Committee Configuration Optimization for Parallel Byzantine Consensus in a Trusted Execution Environment

TL;DR

This paper introduces an optimization model for committee configuration in trusted parallel Byzantine Fault Tolerance protocols, significantly improving transaction throughput by minimizing latency through mixed integer programming considering delays and failures.

Contribution

It presents a novel committee configuration optimization (CCO) model that enhances performance in trusted parallel BFT systems, addressing limitations of randomized assignment methods.

Findings

15% increase in transaction throughput under normal operations

21% increase during fallback processes

Effective optimization of committee configurations improves system performance

Abstract

Parallel Byzantine Fault Tolerant (BFT) protocols based on committee-based sharding improve scalability but weaken safety since smaller node groups are responsible for consensus. Recent approaches integrate trusted execution environments (TEEs) into parallel BFT frameworks to enhance safety. While the scalability and safety issues are addressed by trusted parallel BFT, existing committee configuration methods often rely on randomized assignment, which can degrade performance. This paper proposes a committee configuration optimization (CCO) model based on mixed integer programming to improve transaction performance for trusted parallel BFT. The model considers communication delays and node failure rates to determine an optimal committee configuration that minimizes transaction latency under both normal operations and scenarios of trusted hardware failures. We integrate CCO into a trusted parallel BFT protocol and evaluate the performance on Microsoft virtual machines. Experimental results demonstrate 15% and 21% improved transaction throughput under normal operations and fallback process, respectively, highlighting the benefits of optimization-driven committee configuration in trusted parallel BFT systems.