Test cases - adimitrova/DistributedAlgorithms GitHub Wiki

Test cases:

  • Having the number of faulty processes, check for the port and create these nodes as faulty byzantine

    • Faulty byzantine sends value opposite to the received one
    • Faulty byzantine sends a random value independent of what it received.

  • Show that we cannot reach consensus when the condition of n > 5f is not met

  • Show that we reach a consensus when the condition if n > 5f is met

  • find max amount of processes the pc can run before it dies

  • asynchronous: get random delays for some messages in broadcast()

  • asynchronous: start round 2 before round 1 is completed

  • asynchronous:

In the report explain:

  • how we keep track of the P and N values and how we access them (diff and index)

  • the IDK value we selected

  • Update the class diagram