Results 171 to 180 of about 1,316 (199)
Some of the next articles are maybe not open access.
Improving PTP robustness to the byzantine failure
2015 IEEE International Symposium on Precision Clock Synchronization for Measurement, Control, and Communication (ISPCS), 2015Computer and telecommunications advances in the last years allowed new distributed applications developments. In this context, time synchronization is a very important issue. Many industrial sectors, such as financial and power, need to achieve high time accuracy.
Marcelo Dalmas +3 more
openaire +1 more source
Reliable communication in networks with Byzantine link failures
Networks, 1992AbstractWe consider the problem of communication between nodes of a network whose links are subject to arbitrary failures: A failed link may not only stop transmitting messages but may corrupt them in any possible way. We characterize networks allowing communication in spite of at most t failures. Also, for every fixed link failure probability p ≤ .29,
openaire +1 more source
Renaming in Message Passing Systems with Byzantine Failures
2006We study the renaming problem in a fully connected synchronous network with Byzantine failures. We show that when faulty processors are able to cheat about their original identities, this problem cannot be solved in an a priori bounded number of rounds for $t\geq(n+n\textrm{ mod }3)/3$, where n is the size of the network and t is the number of failures.
Michael Okun, Amnon Barak
openaire +1 more source
An on-demand secure routing protocol resilient to byzantine failures
Proceedings of the 1st ACM workshop on Wireless security, 2002An ad hoc wireless network is an autonomous self-organizing system ofmobile nodes connected by wireless links where nodes not in directrange can communicate via intermediate nodes. A common technique usedin routing protocols for ad hoc wireless networks is to establish therouting paths on-demand, as opposed to continually maintaining acomplete routing ...
Baruch Awerbuch +3 more
openaire +1 more source
Brief Announcement: Byzantine Agreement with Unknown Participants and Failures
Proceedings of the 39th Symposium on Principles of Distributed Computing, 2020A set of participants that want to agree on a common opinion despite the presence of malicious or Byzantine participants need to solve an instance of a Byzantine agreement problem. This classic problem has been well studied but most of the existing solutions assume that the participants are aware of n --- the total number of participants in the system -
Pankaj Khanchandani, Roger Wattenhofer
openaire +1 more source
Byzantine failure detection in wireless ad-hoc networks
2015 36th IEEE Sarnoff Symposium, 2015Wireless multihop networks consist of numbers of wireless nodes. Hence, introduction of failure detection and recovery is mandatory. Until now, various failure detection and recovery methods such as route switch and multiple routes detection have been proposed based on an assumption with stop failure model.
Norihiro Sota, Hiroaki Higaki
openaire +1 more source
Optimally simulating crash failures in a byzantine environment
2005The difficulty of designing of fault-tolerant distributed algorithms increases with the severity of failures that an algorithm must tolerate. Researchers have simplified this task by developing methods that automatically translate protocols tolerant of “benign” failures into ones tolerant of more “severe” failures. In addition to simplifying the design
Rida A. Bazzi, Gil Neiger
openaire +1 more source
Are Byzantine Failures Really Different from Crash Failures?
2016When considering n-process asynchronous systems, where up to t processes can fail, and communication is by read/write registers or reliable message-passing, are (from a computability point of view) Byzantine failures “different” from crash failures?
Damien Imbs +2 more
openaire +1 more source
Byzantine Agreement under dual failure mobile network
Computer Standards & Interfaces, 2006Networks are trending towards wireless systems that provide support for mobile computing. The Byzantine Agreement (BA) protocols used in static networks do not perform well in a dynamically changing mobile environment. Mobile commerce and related applications are necessary for wireless networks.
Shu-Ching Wang, Kuo-Qin Yan
openaire +1 more source
A Time-Free Byzantine Failure Detector for Dynamic Networks
2012 Ninth European Dependable Computing Conference, 2012Modern distributed systems deployed over wireless ad-hoc networks are inherently dynamic and the issue of designing dependable services which can cope with the high dynamics of these systems is a challenge. Byzantine failure detectors provide an elegant abstraction for implementing Byzantine fault tolerance.
Greve, Fabíola +3 more
openaire +2 more sources