If you want to give our simulator a go, fill out the following form and we will simulate your specified scenario. The two key choices the consensus algorithm and the type of benchmark you wish to use.
We will get the results back to you as soon as they are ready.
For educational purposes only, please do not base business decisions on these results. No promise of delivery, no warranty.
 M. Al-Fares, A. Loukissas, and A. Vahdat. A Scalable, Commodity Data Center Network Architecture. SIGCOMM Comput. Commun. Rev., 38(4):63–74, August 2008.
 L. Lamport. The Part-time Parliament. ACM Trans. Comput. Syst., 16(2):133–169, May 1998.
 M. Poke, T. Hoefler and C. W. Glass. AllConcur: Leaderless Concurrent Atomic Broadcast. In Proc. 26th International Symposium on High-Performance Parallel and Distributed Computing, HPDC 2017. An extended technical report is freely available on arXiv.
 T. Soneoka, M. Imase, and Y. Manabe. Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter II. Discrete Appl. Math., 64(3):267–279, February 1996.
 M. Poke and C. W. Glass. A Dual Digraph Approach for Leaderless Atomic Broadcast. In Proc. 38th International Symposium on Reliable Distributed Systems, SRDS 2019. An extended technical report is freely available on arXiv.