Adapting PBFT for Use With Blockchain-Enabled IoT Systems

This work proposes Practical Byzantine Fault Tolerance (PBFT) ordering service needed for block formation in permissioned blockchain environments. Contrary to current PBFT implementations that only provide a single point of entry to the ordering service, we allow each ordering node to act as an entry point that proposes and conducts the consensus process of including new record in the distributed ledger. To ensure atomicity of record insertion in distributed ledger, we have developed a bandwidth reservation protocol that uses a modification of CSMA/CA protocol to regulate access to the broadcast medium formed by the P2P network of TCP connections between orderers. We have modeled record insertion service time in a cluster where ordering nodes have random position within Cartesian coordinate system. We have also modeled total request access time to the ledger which includes waiting time in the orderer's queue and record insertion time. These models are used to evaluate system performance under variable request rate ordering service, variable number of nodes and variable physical cluster dimensions. Our results show the interaction between decreased request waiting time in orderer's queue and increased contention among orderers when the number of orderers increases for the given total request arrival rate. This interaction is also investigated for two different physical cluster sizes which affect record insertion time. The interplay of request rate, number of orderers and physical cluster size determines system capacity expressed in total request rate. Our model can be used to make the trade-off between the required system capacity, number of orderers, and physical cluster dimensions under constraints on Byzantine fault rate.