Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures

@article{Bonomi2018ReliableBI,
  title={Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures},
  author={Silvia Bonomi and Giovanni Farina and S{\'e}bastien Tixeuil},
  journal={ArXiv},
  year={2018},
  volume={abs/1811.01770}
}
  • Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil
  • Published 2018
  • Computer Science
  • ArXiv
  • Ensuring reliable communication despite possibly malicious participants is a primary objective in any distributed system or network. In this paper, we investigate the possibility of reliable broadcast in a dynamic network whose topology may evolve while the broadcast is in progress. In particular, we adapt the Certified Propagation Algorithm (CPA) to make it work on dynamic networks and we present conditions (on the underlying dynamic graph) to enable safety and liveness properties of the… CONTINUE READING

    Figures and Topics from this paper.

    Explore key concepts

    Links to highly relevant papers for key concepts in this paper:

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    Reliable Broadcast in Networks with Trusted Nodes

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Network Topology and Fault-Tolerant Consensus

    Resilient Leader-Follower Consensus with Time-Varying Leaders in Discrete-Time Systems

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES

    Byzantine broadcast with fixed disjoint paths

    Reliable Broadcast in Radio Networks with Locally Bounded Failures

    VIEW 1 EXCERPT

    Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures

    VIEW 2 EXCERPTS

    Containing Byzantine Failures with Control Zones

    Efficient Byzantine broadcast in wireless ad-hoc networks

    VIEW 1 EXCERPT