A comment on "A total ordering multicast protocol using propagation trees"
Shiuhpyng Winston Shieh, Fu-Shen Ho · IEEE Transactions on Parallel and Distributed Systems · 1997
In this paper, we reevaluate the message cost of X. Jia's multicast mechanism (see ibid., vol. 6, no. 6, p. 617-27 (1995)). 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.