Issue No. 10 - October (2008 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.16
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Does optimizing a protocol for better message complexity hamper the time complexity? In this paper, we investigate these types of questions using mathematical analysis as well as experiments over PlanetLab (WAN) and a LAN. We present a new and efficient leader-based consensus protocol that has O(n) stable-state message complexity (in a system with n processes) and requires only O(n) links to be timely at stable times. We compare this protocol with several previously suggested protocols. Our results show that a protocol that requires fewer timely links can achieve better performance, even if it sends fewer messages.
Distributed Systems, synchrony assumptions, eventual synchrony, failure detectors, consensus algorithms, FT Middleware
A. Shraer and I. Keidar, "How to Choose a Timing Model," in IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 1367-1380, 2008.