We present a novel implementation of the eventually perfect failure detector (Prom the original hierarchy of Chandra-Toueg oracles. Previous implementations of P have assumed models of partial synchrony where point-to-point message delay is bounded and/or communication is reliable. We show how to implement this important oracle under even weaker assumptions using Average Delayed/Dropped (ADD) channels. Briefly, all messages sent on an ADD channel are privileged or non-privileged. All non-privileged messages can be arbitrarily delayed or even dropped. For each run, however, there exists an unknown window size w, and two unknown upper-bounds d and r, where d bounds the average delay of the last w privileged messages, and r bounds the ratio of non-privileged messages to privileged messages per window. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Sastry, S., & Pike, S. M. (2007). Eventually perfect failure detectors using ADD channels. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4742 LNCS, pp. 483–496). Springer Verlag. https://doi.org/10.1007/978-3-540-74742-0_44
Mendeley helps you to discover research relevant for your work.