Concept
Broadcast syndication
Related publications (6)
As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!
Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert
In a non-synchronous system with n processes, no t(0)-resilient (deterministic or probabilistic) Byzantine consensus protocol can prevent a disagreement among correct processes if the number of faulty processes is > n - 2t(0). Therefore, the community defi ...
ACADEMIC PRESS INC ELSEVIER SCIENCE2023As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!
Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert
It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...
IEEE2022GSN Cloud Storage and Processing
GSN (Global Sensor Networks) is capable of managing configurable virtual sensors through a wide range of wrappers, and is able to manage one-shot and continuous queries, even in a distributed environment with several GSN instances. However, each GSN instan ...
2015Algebraic algorithms for network information flow
Ahlswede et al. in the seminal paper [1] have shown that in data transfer over networks, processing the data at the nodes can significantly improve the throughput. As proved by Li et al. in [2], even with a simple type of operation, namely linear operation ...
EPFL2013A Lower Bound for Broadcasting in Mobile Ad Hoc Networks
André Schiper, David Cavin, Yoav Sasson
We give a lower bound of rounds for broadcasting in a mobile ad hoc network, where is the number of nodes in the network. A round is the time taken by a node to successfully transmit a message to all its neighbors. It has been shown by Brus ...
2004