关键词:
Communication
Multicast
Implement
Systems
Time
multicast communication
Messages
Network topology
algorithms
Communication Research
Mobile Computing
bandwidth requirement
Multicast
摘要:
Causal message ordering is required for several distributed applications, In order to preserve causal ordering, only direct dependency information between messages, with respect to the destination process(es), need be sent with each message. By eliminating other kinds of control information from the messages, the communication overheads can be significantly reduced, In this paper we present an algorithm that uses this knowledge to efficiently enforce causal ordering of messages, The proposed algorithm does not require any prior knowledge of the network topology or communication pattern, As computation proceeds, it acquires knowledge of the communication pattern and is capable of handling dynamically changing multicast communication groups, and minimizing the communication overheads, With regard to communication overheads, the algorithm is optimal for the broadcast communication case, Extensive simulation experiments demonstrate that the algorithm imposes lower communication overheads than previous causal ordering algorithms, The algorithm can be employed in a variety of distributed computing environments, Its energy efficiency and low bandwidth requirement make it especially suitable for mobile computing systems, We show how to employ the algorithm for causally ordered multicasting of messages in mobile computing environments. (C) 1997 Academic Press.