Heuristic token selection for total order reliable multicast communication

Weijia Jia, Jiannong Cao, Xiaohua Jia

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

2 Citations (Scopus)

Abstract

An efficient multicast protocol is presented by using a heuristic function for passing a virtual token to decide the message total ordering. Unlike existing token-passing based algorithms, there is no physical token passing message in the protocol, instead, the token holder piggybacks token passing onto normal multicast messages. Executing the heuristic function does not incur any communication overhead and only relies on 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 average (n-2)/k point-to-point control messages. Dynamic membership is non-blocking, namely, 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 consistent order of normal multicast messages. Performance of the protocol is shown by implementation figures.
Original languageEnglish
Title of host publicationProceedings of the International Symposium on Autonomous Decentralized Systems
PublisherIEEE
Pages61-68
Number of pages8
Publication statusPublished - 1 Jan 1997
Externally publishedYes
EventProceedings of the 1997 3rd International Symposium on Autonomous Decentralized Systems, ISADS'97 - Berlin, Germany
Duration: 9 Apr 199711 Apr 1997

Conference

ConferenceProceedings of the 1997 3rd International Symposium on Autonomous Decentralized Systems, ISADS'97
CountryGermany
CityBerlin
Period9/04/9711/04/97

ASJC Scopus subject areas

  • Hardware and Architecture
  • Engineering (miscellaneous)

Cite this