Reliable broadcast in unknown fixed-identity networks

DOI10.1145/1073814.1073880zbMath1314.68050OpenAlexW2140749668MaRDI 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 agreementreliable broadcastunknown network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Graph algorithms (graph-theoretic aspects) (05C85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (1)

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

This page was built for publication: Reliable broadcast in unknown fixed-identity networks