arXiv Open Access 2012

Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs

Nitin Vaidya Lewis Tseng Guanfeng Liang

Lihat Sumber

Abstrak

In this paper, we explore the problem of iterative approximate Byzantine consensus in arbitrary directed graphs. In particular, we prove a necessary and sufficient condition for the existence of iterative byzantine consensus algorithms. Additionally, we use our sufficient condition to examine whether such algorithms exist for some specific graphs.

Topik & Kata Kunci

cs.DC

Penulis (3)

Nitin Vaidya

Lewis Tseng

Guanfeng Liang

Format Sitasi

APA MLA BibTeX

Vaidya, N., Tseng, L., Liang, G. (2012). Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs. https://arxiv.org/abs/1201.4183

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2012
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓