Accession Number ADA564307
Title Parameter-independent Iterative Approximate Byzantine Consensus.
Publication Date Aug 2012
Media Count 16p
Personal Author L. Tseng N. Vaidya
Abstract In this work, we explore iterative approximate Byzantine consensus algorithms that do not make explicit use of the global parameter of the graph, i.e., the upper-bound on the number of faults.
Keywords Algorithms
Byzantine
Communication and radio systems
Communications networks
Consensus
Convex bodies
Global
Graphs
Iterations
Nodes
Parameters


 
Source Agency Non Paid ADAS
NTIS Subject Category 72B - Algebra, Analysis, Geometry, & Mathematical Logic
45C - Common Carrier & Satellite
Corporate Author Illinois Univ. at Urbana-Champaign. Dept. of Electrical and Computer Engineering.
Document Type Technical report
Title Note Technical rept.
NTIS Issue Number 1303
Contract Number W911-NF-0710287

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