This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Total Ordering Multicast Protocol Using Propagation Trees
June 1995 (vol. 6 no. 6)
pp. 617-627

Abstract—The paper discusses a multicast mechanism using propagation trees. It guarantees the total ordering (including causal ordering) of messages in multiple groups. The mechanism introduces a concept of meta-groups (a subset of a multicast group) and organizes meta-groups into propagation trees. Compared with the existing propagation tree mechanisms, this mechanism has the following advantages: 1) Greater parallelism. Messages can be sent to destinations by using broadcast networks. 2) Less message cost and less latency time. It takes less network communication to multicast a message and less time to have the message delivered to all the destinations. 3) More flexibility to dynamic membership changes and higher reliability for message propagation. It does not need to restructure propagation trees when there is a change in membership, and a site failure does not stop the message propagation to its descendants in the tree.

Index Terms—Atomicity of group communication, distributed systems, message ordering, multicast protocols, network communication, process synchronization.

[1] K. Birman and T. Joseph, "Reliable Communications in Presence of Failures," ACM Trans. Computing Systems, vol. 5, no. 1, pp. 47-76, 1987.
[2] K. Birman, A. Schiper, and P. Stephenson, “Lightweight Causal and Atomic Group Multicast,” ACM Trans. Computer Systems, vol. 9, no. 3, pp. 272-314, Aug. 1991.
[3] K. Birman and R. Cooper,“The ISIS project: Real experience with a fault tolerant programming system,”ACM Oper. Syst. Rev.,vol. 25, no. 2, pp. 103–107, Apr. 1991.
[4] K. Birman, "The Process Group Approach to Reliable Distributed Computing," Comm. ACM, vol. 36, no. 12, pp. 37-53, 1993.
[5] J. Chang and N. Maxemchuk,“Reliable broadcast protocols,”ACM Trans. Comput. Syst., vol. 2, pp. 251–273, Aug. 1984.
[6] H. Garcia-Molina and A. Spauster,"Ordered and Reliable Multicast Communication," ACM Trans. Computer Systems, vol. 6, no. 3, Aug. 1991, pp. 242-271.
[7] T. A. Joseph and K. Birman,“Reliable broadcast protocols,”Lecture Notes of Arctic 88—An Advanced Course on Operating Systems, Tromsö, Norway, July 1988, pp. 293-317.
[8] M.F. Kaashoek, A.S. Tanenbaum, S. Hummel, and H.E. Bal, “An Efficient Reliable Broadcast Protocol,” Operating Systems Review, vol. 23, no. 4, pp. 5–19, Oct. 1989.
[9] L. Lamport, "Time, clocks and the ordering of events in a distributed system," Comm. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[10] L. Liang, S. T. Chanson, and G. W. Neufeld,“Process groups and group communications: Classifications and requirements,”IEEE Comput.,vol. 23, pp. 56–66, Feb. 1990.
[11] S.-W. Luan and V. D. Gligor,“A fault-tolerant protocol for atomic broadcast,”IEEE Trans. Parallel Distrib. Syst.,vol. 1, pp. 271–285, July 1990.
[12] P. Melliar-Smith, L. Moser, and V. Agrawala,“Broadcast protocols for distributed systems,”IEEE Trans. Parallel Distributed Syst., vol. 1, pp. 17–25, Jan. 1990.
[13] S. Navaratnam, S. Chanson, and G. Neufeld,“Reliable group communication in distributed systems,”inProc. 8th IEEE Int. Conf. Distrib. Comput. Syst.,June 1988, pp. 439–446.
[14] T. P. Ng,“Ordered broadcasts for large applications,”inProc. 10th Symp. Reliable Distrib. Syst.,1991, pp. 188–197.
[15] A. Schiper, J. Eggli, and A. Sandoz, "A New Algorithm to Implement Causal Ordering," Proc. Third Int'l Workshop Distributed Algorithms, pp. 219-232,Berlin, 1989.
[16] A. S. Tanenbaum, M. F. Kaashoek, and H. E. Bal,“Parallel programming using shared objects and broadcasting,”IEEE Comput.,Aug. 1992, pp. 10–19.

Citation:
Xiaohua Jia, "A Total Ordering Multicast Protocol Using Propagation Trees," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 6, pp. 617-627, June 1995, doi:10.1109/71.388042
Usage of this product signifies your acceptance of the Terms of Use.