A Total Ordering Multicast Protocol Using Propagation Trees
IEEE Transactions on Parallel and Distributed Systems
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
In this paper, we reevaluate the message cost of Jia's multicast mechanism. Our analysis shows that its message cost should be (D + k + 1) instead of (D + 2), where D is the depth of the subtree and k is the number of metagroups containing the destination multicast group.