Broadcast Using Certified Propagation Algorithm in Presence of Byzantine Faults
ILLINOIS UNIV AT URBANA-CHAMPAIGN DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
We explore the correctness of the Certified Propagation Algorithm CPA 5, 1, 7, 4 in solving broadcast with locally bounded Byzantine faults. CPA allows the nodes to use only local information regarding the network topology. We provide a tight necessary and sufficient condition on the network topology for the correctness of CPA. We also present some simple extensions of this result.
- Numerical Mathematics