An efficient causal ordering algorithm for mobile computing environments

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) should 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 or communication topology. As computation proceeds, it acquires knowledge of the logical communication topology and is capable of handling dynamically changing multicast communication groups. With regard to communication overheads, the algorithm is optimal for the broadcast communication case. Its energy efficiency and four bandwidth requirement make it suitable for mobile computing systems. We present a strategy that employs the algorithm for causally ordered multicasting of messages in mobile computing environments.

[1]  André Schiper,et al.  Lightweight causal and atomic group multicast , 1991, TOCS.

[2]  A. Mostefaoui,et al.  Causal multicasts in overlapping groups: towards a low cost approach , 1993, 1993 4th Workshop on Future Trends of Distributed Computing Systems.

[3]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[4]  Roberto BALDONI,et al.  Efficient causally ordered communications for multimedia real-time applications , 1995, Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing.

[5]  Colin J. Fidge,et al.  Timestamps in Message-Passing Systems That Preserve the Partial Ordering , 1988 .

[6]  Sridhar Alagar.  Causally Ordered Message Delivery in Mobile Systems , 1994, 1994 First Workshop on Mobile Computing Systems and Applications.

[7]  Kenneth P. Birman,et al.  Reliable communication in the presence of failures , 1987, TOCS.

[8]  LamportLeslie.  Time, clocks, and the ordering of events in a distributed system , 1978 .

[9]  André Schiper,et al.  A New Algorithm to Implement Causal Ordering , 1989, WDAG.

[10]  M. Callendar.  International standards for personal communications , 1989, IEEE 39th Vehicular Technology Conference.

[11]  B. R. Badrinath,et al.  A framework for delivering multicast messages in networks with mobile hosts , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

[12]  Paulo Veríssimo,et al.  Causal separators for large-scale multicast communication , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[13]  Mukesh Singhal,et al.  Real‐time causal message ordering in multimedia systems , 1997, Telecommun. Syst..

[14]  Toshihide Ibaraki,et al.  Logically Instantaneous Message Passing in Asynchronous Distributed Systems , 1994, IEEE Trans. Computers.

[15]  Tomasz Imielinski,et al.  Mobile wireless computing: challenges in data management , 1994, CACM.

[16]  Richard D. Schlichting,et al.  Preserving and using context information in interprocess communication , 1989, TOCS.

[17]  André Schiper,et al.  The Causal Ordering Abstraction and a Simple Way to Implement it , 1991, Inf. Process. Lett..

[18]  Tomasz Imielinski,et al.  Mobile wireless computing , 1994 .