Results 181 to 190 of about 1,316 (199)

On the message complexity of binary byzantine agreement under crash failures

Distributed Computing, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eugene S. Amdur, Samuel M. Weber, Vassos Hadzilacos   +2 more
openaire   +2 more sources

Communicating Reliably in Multihop Dynamic Networks Despite Byzantine Failures

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS), 2015
We consider the following problem: two nodes want to reliably communicate in a dynamic multihop network where some nodes have been compromised, and may have a totally arbitrary and unpredictable behavior. These nodes are called Byzantine. We consider the two cases where cryptography is available and not available.
Sébastien Tixeuil, Xavier Defagó
exaly   +3 more sources

Enhanced Fault-Tolerance through Byzantine Failure Detection

2009
We consider a variant of the Byzantine failure model in which Byzantine processes are eventually detected and silenced, and investigate the fault-tolerance of the classical broadcast and agreement problems. We show that if all Byzantine processes are eventually detected, then it is possible to solve the broadcast problem in the presence of any number ...
Rida A. Bazzi, Maurice Herlihy
openaire   +1 more source

Efficient Byzantine Reliable Broadcast in the Failure Case.

Reliable broadcast is a fundamental primitive in distributed computing that is widely used in various applications. Several new reliable broadcast algorithms have been presented in recent years, primarily focusing on reducing the communication complexity, which is the total number of exchanged bits in the worst case. While significant progress has been
openaire   +2 more sources

NetShield: An in-network architecture against byzantine failures in distributed deep learning

Computer Networks, 2023
Qingqing Ren, Shuyong Zhu, Yujun Zhang   +2 more
exaly  

Consensus using omega in asynchronous systems with unknown membership and degenerative Byzantine failures

Journal of Computer and System Sciences, 2020
, JOSÉ Luis Lopez-Presa, Javier Martín-Rueda   +2 more
exaly  

Defending Byzantine Failures for Federated Learning

2024 IEEE International Conference on Smart Internet of Things (SmartIoT)
Ang Li, Ke Xing, Yanjie Dong 0003
openaire   +1 more source

Analysis of Ant Colony Optimization-based routing in optical networks in the presence of byzantine failures

Information Sciences, 2016
Gustavo Sousa Pavani
exaly  

Reliable Broadcast in Dynamic Networks with Locally Bounded Byzantine Failures

Lecture Notes in Computer Science, 2018
Silvia Bonomi, Giovanni Farina, Sébastien Tixeuil   +2 more
exaly  

Distributed system diagnosis of byzantine failures in partially connected multicomputer systems

Automation and Remote Control, 2005
A V Lobanov, Lobanov A V
exaly