A Note on Total Ordering Multicast Using Propagation Trees

Authors:
Ge-Ming Chiu;Chih-Ming Hsiao
Affiliations:
National Taiwan Univ. of Science and Technology, Taipei, Taiwan;National Taiwan Univ. of Science and Technology, Taipei, Taiwan
Venue:
IEEE Transactions on Parallel and Distributed Systems
Year:
1998

Citing 8
Cited 3

Process Groups and Group Communications: Classifications and Requirements

Computer
Ordered and reliable multicast communication

ACM Transactions on Computer Systems (TOCS)
Lightweight causal and atomic group multicast

ACM Transactions on Computer Systems (TOCS)
Distributed operating systems

Distributed operating systems
A Total Ordering Multicast Protocol Using Propagation Trees

IEEE Transactions on Parallel and Distributed Systems
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Distributed Systems: Concepts and Design

Distributed Systems: Concepts and Design
Causally Ordering Group Communication Protocol

Proceedings of the 1994 International Conference on Parallel and Distributed Systems

Total order broadcast and multicast algorithms: Taxonomy and survey

ACM Computing Surveys (CSUR)
Total ordering group communication protocol based on coordinating sequencers for multiple overlapping groups

Journal of Parallel and Distributed Computing
Message-ordered multicast by common building blocks

InfoScale '06 Proceedings of the 1st international conference on Scalable information systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Jia proposed [4] a multicast scheme, using propagation trees, to ensure the total ordering (including causal ordering) delivery of messages for group communication. Our study indicates that causal relation between some messages may not actually be preserved in this protocol. We then present a revised approach for closed group communication.