Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Optimal algorithms for Byzantine agreement
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
ACM SIGCOMM Computer Communication Review
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
Fully polynomial Byzantine agreement in t + 1 rounds
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Evidence for long-tailed distributions in the internet
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Dynamic Byzantine Quorum Systems
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Unreliable Intrusion Detection in Distributed Computations
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Tolerating latency in replicated state machines through client speculation
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Proceedings of the 5th European conference on Computer systems
QoS self-configuring failure detectors for distributed systems
DAIS'10 Proceedings of the 10th IFIP WG 6.1 international conference on Distributed Applications and Interoperable Systems
Request Batching Self-Configuration in Byzantine Fault-Tolerant Replication
SBESC '12 Proceedings of the 2012 Brazilian Symposium on Computing System Engineering
| Hi-index | 0.00 |
Castro and Liskov proposed in 1999 a successful solution for byzantine fault-tolerant replication, named PBFT, which overcame performance drawbacks of earlier byzantine faulttolerant replication protocols. Other proposals extended PBFT with further optimizations, improving PBFT performance in certain conditions. One of the key optimizations of PBFT-based protocols is the use a request batching mechanism. If the target distributed system is dynamic, that is, if its underlying characteristics change dynamically, such as workload, channel QoS, network topology, etc., the configuration of the request batching mechanism must follow the dynamics of the system or it may not yield the desired performance improvement. This paper addresses this challenge by proposing an innovative solution to the dynamic configuration of request batching parameters inspired on feedback control theory. In order to evaluate its efficiency, the proposed solution is simulated in various scenarios and compared with the original version used in the PBFT-family protocols.