By Topic

Message efficient reliable 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

1 Author(s)
Sung-Hoon Park ; Dept. of Comput. Sci., Nam-Seoul Univ., Chung Nam, South Korea

As a non-blocking atomic commitment protocol, there is uniform timed reliable broadcast (UTRB) which is proposed by O. Babaoglu and S. Toueg (see “Non-blocking atomic commitment”, “Distributed systems”, 2nd edition, Addison Wesley, chapter 6, 1993). They proposed the UTRB2 that is the most message-efficient UTRB in the literature. We consider two-complexity metrics for UTRB algorithms: time and number of messages. In this paper, we describe a new UTRB protocol, called UTRB5, which is more efficient than UTRB2 in the number of messages and time

Published in:

Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on  (Volume:2 )

Date of Conference:

2000