Accession Number ADA568117
Title Broadcast Using Certified Propagation Algorithm in Presence of Byzantine Faults.
Publication Date Sep 2012
Media Count 8p
Personal Author L. Tseng N. Vaidya V. Bhandari
Abstract 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.
Keywords Algorithms
Byzantine faults
Cpa(Certified propagation algorithm)
Network topology
Nodes


 
Source Agency Non Paid ADAS
NTIS Subject Category 72B - Algebra, Analysis, Geometry, & Mathematical Logic
Corporate Author Illinois Univ. at Urbana-Champaign. Dept. of Computer Science.
Document Type Technical report
Title Note Technical rept.
NTIS Issue Number 1310
Contract Number W911NF-07-1-0287

Science and Technology Highlights

See a sampling of the latest scientific, technical and engineering information from NTIS in the NTIS Technical Reports Newsletter

Acrobat Reader Mobile    Acrobat Reader