Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
نویسندگان
چکیده
We study a well-known communication abstraction called Byzantine Reliable Broadcast (BRB). This is central in the design and implementation of fault-tolerant distributed systems, as many applications require with provable guarantees on message deliveries. Our focuses implementations for message-passing systems that are prone to process-failures, such crashes malicious behavior. At PODC 1983, Bracha Toueg, short, BT, solved BRB problem. BT has optimal resilience since it can deal t<n/3 processes, where n number processes. The present work aims an even more robust solution than by expanding its fault-model self-stabilization, vigorous notion fault-tolerance. In addition tolerating failures, self-stabilizing recover after occurrence arbitrary transient-faults. These transient faults allow model represent temporary deviations from assumptions which system was originally designed operate (provided algorithm code remains intact). propose, best our knowledge, first (BFT) repeated signature-free (that follows BT's problem specifications). contribution includes variation solves single-instance asynchronous systems. also consider recycling instances BRB. BFT time-free facilitates concurrent handling predefined invocations and, this way, serve basis consensus.
منابع مشابه
Parsimonious Asynchronous Byzantine-Fault-Tolerant Atomic Broadcast
Atomic broadcast is a communication primitive that allows a group of n parties to deliver a common sequence of payload messages despite the failure of some parties. We address the problem of asynchronous atomic broadcast when up to t < n/3 parties may exhibit Byzantine behavior. We provide the first protocol with an amortized expected message complexity of O(n) per delivered payload. The most e...
متن کاملSelf-stabilizing and Byzantine-Tolerant Overlay Network
Network overlays have been the subject of intensive research in recent years. The paper presents an overlay structure, S-Fireflies, that is self-stabilizing and is robust against permanent Byzantine faults. The overlay structure has a logarithmic diameter with high probability, which matches the diameter of less robust overlays. The overlay can withstand high churn without affecting the ability...
متن کاملModel Checking a Byzantine-Fault-Tolerant Self-Stabilizing Protocol for Distributed Clock Synchronization Systems
متن کامل
FATAL+: A Self-Stabilizing Byzantine Fault-tolerant Clocking Scheme for SoCs
We present concept and implementation of a self-stabilizing Byzantine fault-tolerant distributed clock generation scheme for multi-synchronous GALS architectures in critical applications. It combines a variant of a recently introduced self-stabilizing algorithm for generating lowfrequency, low-accuracy synchronized pulses with a simple nonstabilizing high-frequency, high-accuracy clock synchron...
متن کاملTowards Self-stabilizing Byzantine Fault-Tolerant Clock Generation in Systems-on-Chip
The most obvious challenges resulting from the tremendous advances of Very Large Scale Integration (VLSI) technology, which has now reached the nanometer scale, are design complexity and robustness issues. Modern Systems-on-Chip (SoC) and Networks-on-Chip (NoC) accommodate Billions of transistors on a single die nowadays, and have in fact much in common with loosely-coupled fault-tolerant distr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2023
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2023.114070