Freiling F, Delporte-Gallet C, Fauconnier H, Tielmann A, Kilic M (2009)
Publication Language: German
Publication Type: Conference contribution, Original article
Publication year: 2009
Publisher: IEEE
Edited Volumes: IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium
City/Town: Rome, Italy
Pages Range: 1-8
Conference Proceedings Title: Proc. 14th IEEE Workshop on Dependable Parallel, Distributed and Network-Centric Systems
Event location: Rome
DOI: 10.1109/IPDPS.2009.5160899
We study the problem of consensus in the general omission failure model, i.e., in systems where processes can crash and omit messages while sending or receiving. This failure model is motivated from a smart card-based security framework in which certain security problems can be reduced to consensus in that model. We propose an algorithm that solves consensus based on very weak timing assumptions. More precisely, we show that consensus is solvable using an eventual bisource and a majority of fault-free processes. An eventual bisource is a fault-free process that can eventually communicate with all other processes in a timely manner. In contrast to previous work, we use timing assumptions directly in the algorithm and do not employ the notion of a failure detector. We argue that this is helpful in reducing the message complexity, a critical aspect of algorithms which run on smart cards. © 2009 IEEE.
APA:
Freiling, F., Delporte-Gallet, C., Fauconnier, H., Tielmann, A., & Kilic, M. (2009). Message-efficient omission-tolerant consensus with limited synchrony. In Proc. 14th IEEE Workshop on Dependable Parallel, Distributed and Network-Centric Systems (S. 1-8). Rome: Rome, Italy: IEEE.
MLA:
Freiling, Felix, et al. "Message-efficient omission-tolerant consensus with limited synchrony." Tagungsband Proc. 14th IEEE Workshop on Dependable Parallel, Distributed and Network-Centric Systems, Rome Rome, Italy: IEEE, 2009. 1-8.
BibTeX: Download