A total ordering multicast protocol using propagation trees - Comment

Abstract

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 the depth of the subtree and k is the number of metagroups containing the destination multicast group.