Back to Search Start Over

Tight Bounds for Connectivity and Set Agreement in Byzantine Synchronous Systems

Authors :
Hammurabi Mendes and Maurice Herlihy
Mendes, Hammurabi
Herlihy, Maurice
Hammurabi Mendes and Maurice Herlihy
Mendes, Hammurabi
Herlihy, Maurice
Publication Year :
2017

Abstract

In this paper, we show that the protocol complex of a Byzantine synchronous system can remain (k-1)-connected for up to ceil(t/k) rounds, where t is the maximum number of Byzantine processes, and t >= k >= 1. This topological property implies that ceil(t/k) + 1 rounds are necessary to solve k-set agreement in Byzantine synchronous systems, compared to floor(t/k) + 1 rounds in synchronous crash-failure systems. We also show that our connectivity bound is tight as we indicate solutions to Byzantine k-set agreement in exactly ceil(t/k) + 1 synchronous rounds, at least when n is suitably large compared to t. In conclusion, we see how Byzantine failures can potentially require one extra round to solve k-set agreement, and, for n suitably large compared to t, at most that.

Details

Database :
OAIster
Notes :
application/pdf, English
Publication Type :
Electronic Resource
Accession number :
edsoai.on1358723826
Document Type :
Electronic Resource
Full Text :
https://doi.org/10.4230.LIPIcs.DISC.2017.35