Reliable broadcast in unknown fixed-identity networks

DOI10.1145/1073814.1073880zbMath1314.68050MaRDI QIDQ5177257

Lakshminarayanan Subramanian, Volker Roth, Scott J. Shenker, Ion Lucretiu Stoica, Randy H. Katz

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073814.1073880

zbMATH Keywords

Byzantine agreement; reliable broadcast; unknown network

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

94A60: Cryptography

05C85: Graph algorithms (graph-theoretic aspects)

68M14: Distributed systems

68M15: Reliability, testing and fault tolerance of networks and computer systems

68M12: Network protocols

68W15: Distributed algorithms

Related Items

On the round complexity of Byzantine agreement without initial set-up