作者: Idit Keidar Alexander Shraer , I Keidar , None
DOI: 10.1109/DSN.2007.55
关键词:
摘要: When employing a consensus algorithm for state machine replication, should one optimize the case that all communication links are usually timely, or fewer timely links? Does optimizing protocol better message complexity hamper time complexity? In this paper, we investigate these types of questions using mathematical analysis as well experiments over PlanetLab (WAN) and LAN. We present new efficient leader-based has O(n) stable-state (in system with n processes) requires only to be at stable times. compare several previously suggested protocols. Our results show can achieve performance, even if it sends messages.