| Status | 已發表Published |
| Heuristic token selection for total order reliable multicast communication | |
| Jia Weijia; Cao Jiannong; Jia Xiaohua | |
| 1997 | |
| Source Publication | Proceedings of the International Symposium on Autonomous Decentralized Systems
 |
| Pages | 61-68 |
| 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. |
| URL | View the original |
| Language | 英語English |
| Fulltext Access | |
| Document Type | Conference paper |
| Collection | University of Macau |
| Affiliation | City University of Hong Kong |
| Recommended Citation GB/T 7714 | Jia Weijia,Cao Jiannong,Jia Xiaohua. Heuristic token selection for total order reliable multicast communication[C], 1997, 61-68. |
| APA | Jia Weijia., Cao Jiannong., & Jia Xiaohua (1997). Heuristic token selection for total order reliable multicast communication. Proceedings of the International Symposium on Autonomous Decentralized Systems, 61-68. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment