Work

Exact Byzantine Consensus Under Local-Broadcast Model

Year: 2018

Type: preprint

Abstract: This paper considers the problem of achieving exact Byzantine consensus in a synchronous system under a local-broadcast communication model. The nodes communicate with each other via message-passing. The communication network is modeled as an undirected graph, with each vertex representing a node in the system. Under the local-broadcast communication model, when any node transmits a message, all its neighbors in the communication graph receive the message reliably. This communication model is motivated by wireless networks. In this work, we present necessary and sufficient conditions on the underlying communication graph to achieve exact Byzantine consensus under the local-broadcast communication model.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1811.08535

Authors: Naqvi, Syed Shalan, Khan, Muhammad Samir, Vaidya, Nitin H.

Institutions: University of Illinois Urbana-Champaign, Georgetown University

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Award: CSR: Medium: Availability-Consistency Tradeoffs in Key-Value and NoSQL Storage Systems

OpenAlex ID: W2901490897

Cites: 9

Cited by: 4

Related to: 20