This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Comment on "A Total Ordering Multicast Protocol Using Propagation Trees"
October 1997 (vol. 8 no. 10)
pp. 1084

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

[1] X. Jia, "A Total Ordering Multicast Protocol Using Propagation Trees," IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 6, pp. 617-627, June 1995.

Index Terms:
Multicast protocols, group communication, message ordering, distributed systems, process synchronization.
Citation:
Shiuh-Pyng Shieh, Fu-Shen Ho, "A Comment on "A Total Ordering Multicast Protocol Using Propagation Trees"," IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 10, pp. 1084, Oct. 1997, doi:10.1109/71.629490
Usage of this product signifies your acceptance of the Terms of Use.