This paper describes the first Reliable Broadcast algorithms that are simultaneously efficient in both time and messages. These algorithms tolerate crash and omission failures. Each Reliable Broadcast takes O(f) time and O(fn) messages, where f is the number of processes that actually fail during this broadcast and n is the total number of processes. In other words, each additional process that fails during a broadcast can increase the broadcast time by at most a constant, and the number of messages by at most O(n). The algorithm tolerant of crash failures requires f+2 rounds. The one for general-omission failures requires 2f+3 rounds.
CITATION STYLE
Chandra, T. D., & Toueg, S. (1991). Time and message efficient Reliable Broadcasts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 486 LNCS, pp. 289–303). Springer Verlag. https://doi.org/10.1007/3-540-54099-7_20
Mendeley helps you to discover research relevant for your work.