By Topic

Heuristic token selection for total order reliable multicast communication

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

3 Author(s)
Weijia Jia ; City Univ. of Hong Kong, Hong Kong ; Jiannong Cao ; Xiaohua Jia

An efficient multicast protocol is presented by using a heuristic function for passing a virtual token to decide the total message ordering. Unlike existing token-passing based algorithms, there is no physical token-passing message in the protocol. Instead, the token holder piggybacks token passing on to normal multicast messages. Executing the heuristic function does not incur any communication overhead and only relies on the local information of a token holder. For a group of n processes and k multicast messages, the protocol is able to achieve atomicity of one message by an average of (n-2)/k point-to-point control messages. Dynamic membership is non-blocking, i.e. each individual process in the group can take unilateral decisions at each step of the membership algorithms. System-wide consistent group configuration can be obtained in a consistent order of normal multicast messages. The performance of the protocol is shown by implementation figures

Published in:

Autonomous Decentralized Systems, 1997. Proceedings. ISADS 97., Third International Symposium on

Date of Conference:

9-11 Apr 1997