/BFT-ReliableCommunication

Simulation code of "Multi Hop Byzantine Reliable Broadcast with honest dealer made practical"

Primary LanguagePython

Multi Hop Byzantine Reliable Broadcast with honest dealer made practical

Silvia Bonomi, Giovanni Farina ✉, Sébastien Tixeuil

Simulation Code

Reference: https://doi.org/10.1186/s13173-019-0090-x

The simulation code is composed by:

  • Python scripts of the simulations;
  • A fork of Vera-Licona Research Group generator for the minimal hitting set problem, supporting the VC solver;
  • The networkx implementations for k-pasted-tree, k-diamond , generalized wheel and multipartite wheel.

Required Python Module:

Setting up the simulation environment on Ubuntu:

  • Clone this repository;

  • Clone the VC solver repository and install required dependencies executing the subsequent commands:

    • sudo apt-get install libboost-all-dev
    • cd BFT-BRB
    • mkdir results
    • git clone https://github.com/giovannifarina/Minimum-Hitting-Set-Fork.git MHS
    • make -C MHS -j

  • Comment/uncomment/edit final lines in Reliable_Broadcast.py to set a specific simulation.