Iterative approximate Byzantine consensus under a generalized fault model

DOI10.1007/978-3-642-35668-1_6zbMATH Open1352.68024arXiv1205.4809OpenAlexW1510375514MaRDI QIDQ5507399FDOQ5507399

Authors: Lewis Tseng, Nitin H. Vaidya 

Publication date: 19 December 2016

Published in: Distributed Computing and Networking (Search for Journal in Brave)

Abstract: In this work, we consider a generalized fault model that can be used to represent a wide range of failure scenarios, including correlated failures and non-uniform node reliabilities. This fault model is general in the sense that fault models studied in prior related work, such as f -total and f -local models, are special cases of the generalized fault model. Under the generalized fault model, we explore iterative approximate Byzantine consensus (IABC) algorithms in arbitrary directed networks. We prove a necessary and sufficient condition for the existence of IABC algorithms. The use of the generalized fault model helps to gain a better understanding of IABC algorithms.

Full work available at URL: https://arxiv.org/abs/1205.4809

Recommendations

• Iterative approximate Byzantine consensus in arbitrary directed graphs
• Reaching approximate Byzantine consensus with multi-hop communication
• Reaching approximate Byzantine consensus with multi-hop communication
• An improved approximate consensus algorithm in the presence of mobile faults
• Fault-tolerant consensus in directed graphs

zbMATH Keywords

graph propertygeneralized fault modeliterative consensus

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Cited In (9)

• Title not available (Why is that?)
• Reaching approximate Byzantine consensus with multi-hop communication
• Approximate agreement under mobile Byzantine faults
• Reaching approximate Byzantine consensus with multi-hop communication
• Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming
• Resilient group consensus in the presence of Byzantine agents
• Resilient distributed vector consensus using centerpoint
• Reliable broadcast with respect to topology knowledge
• Iterative approximate Byzantine consensus in arbitrary directed graphs

This page was built for publication: Iterative approximate Byzantine consensus under a generalized fault model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5507399)