Sciweavers

89 search results - page 4 / 18
» Fast Byzantine Consensus
Sort
View
DSN
2006
IEEE
14 years 10 days ago
Consensus with Byzantine Failures and Little System Synchrony
We study consensus in a message-passing system where only some of the Ò¾ links exhibit some synchrony. This problem was previously studied for systems with process crashes; we n...
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, H...
COMSNETS
2012
176views more  COMSNETS 2012»
12 years 2 months ago
Capacity of Byzantine consensus in capacity limited point-to-point networks
—In this paper, we investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a cap...
Guanfeng Liang, Nitin H. Vaidya
PODC
2012
ACM
11 years 8 months ago
Iterative approximate byzantine consensus in arbitrary directed graphs
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
Nitin H. Vaidya, Lewis Tseng, Guanfeng Liang
OPODIS
2008
13 years 7 months ago
Byzantine Consensus with Unknown Participants
Abstract. Consensus is a fundamental building block used to solve many practical problems that appear on reliable distributed systems. In spite of the fact that consensus is being ...
Eduardo Adílio Pelinson Alchieri, Alysson N...