By Topic

An Efficient Optimistic Atomic Broadcast Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Lei Li ; Inst. of Network Technol. & Inf. Security, National Univ. of Defense Technol., ChangSha ; Huaimin Wang ; Dianxi Shi ; Hui Liu

Atomic broadcast is a fundamental building block in the construction of fault tolerant distributed applications. Although a number of algorithms have been published, the implementation of such a primitive is still considered costly in terms of communication latency. To solve this problem, some algorithms based on optimistic assumptions are proposed. When the optimistic assumption holds, those algorithms are more efficient than conservative algorithms. However, if the assumption does not hold, the efficiency of those algorithms deteriorates. In this paper, we propose a novel optimistic algorithm which exploits the optimistic assumption in a way that never leads to high latency. Simulation experiments have been performed to evaluate the algorithm and the results show it achieves satisfactory performance

Published in:

Grid and Cooperative Computing Workshops, 2006. GCCW '06. Fifth International Conference on

Date of Conference:

Oct. 2006