Description
TL;DR: A mathematical treatment of whether delayed messages preserve convergence and how much they slow agreement among networked nodes.
About This Document
Konstantinos I. Tsianos and Michael G. Rabbat model links that deliver messages after constant or independent bounded delays, including cases where multiple messages arrive from the same neighbor in one iteration. They prove convergence under stated conditions and derive bounds on the loss in convergence speed.
Why Bitcoin People May Care
This is not Bitcoin consensus. The nodes average values under cooperative linear updates rather than order adversarial transactions under proof of work. It remains useful systems background because network delay and asynchronous arrival matter to every distributed protocol. The paper's guarantees depend on its bounded-delay models and should not be transferred directly to cryptocurrency security.
What You Receive
Purchase reveals the verified preserved PDF location for this document.
Document Details
- Title: Communication Delays in Distributed Consensus Algorithms
- Author / organization: Konstantinos I. Tsianos and Michael G. Rabbat
- Year: 2012
- Language: English
- Document type: Distributed-systems research paper
- Pages: 37
CacheRat provides researched source-location and document-identification information. CacheRat does not claim ownership of the underlying third-party documentation.
