Abstract
There is a growing trend in developing applications for mobile computing systems in which mobile host computers retain their network connections while in transit. This paper proposes an algorithm that enforces a useful property, namely, causal ordering, that delivers messages among mobile hosts. This property ensures that causally related messages directed to the same destination will be delivered in an order consistent with their causality, which is important in applications that involve human interaction such as mobile e‐mail and mobile teleconferencing. Such applications are envisioned by the proponents of Personal Communications Services (PCS). Without this property, users may receive and read original messages and the corresponding replies out of order. Our algorithm, when compared with previous proposals, provides an alternative with a low handoff cost, medium message overhead, and low probability of unnecessary inhibition in delivering messages.
Similar content being viewed by others
References
A. Acharya and B.R. Badrinath, Delivering multicast messages in networks with mobile hosts, in: Proc. 13th International Conference on Distributed Computing Systems (May 1993).
A. Acharya and B.R. Badrinath, Checkpointing distributed applications on mobile computers, in: Proc. 3rd International Conference on Parallel and Distributed Information Systems (September 1994).
S. Alagar and S. Venkatesan, Causally ordered message delivery in mobile systems, in: Proc. Workshop on Mobile Computing Systems and Applications (December 1994) pp. 169–174.
L. Alvisi and K. Marzullo, Message logging: Pessimistic, optimistic, and causal, in: Proc. 15th International Conference on Distributed Computing Systems (May 1995).
V. Aravamudhan, K. Ratnam and S. Rangarajan, An efficient multicast protocol for PCS networks, in: Proc. 2nd International Mobile Computing Conference, Hsinchu, Taiwan (March 1996) pp. 25–34.
B.R. Badrinath, A. Acharya and T. Imielinski, Impact of mobility on distributed computations, Oper. Syst. Rev. 27(2) (April 1993) 15–20.
B.R. Badrinath, A. Acharya and T. Imielinski, Structuring distributed algorithms for mobile hosts, in: Proc. 14th International Conference on Distributed Computing Systems (June 1994).
K.P. Birman and T.A. Joseph, Reliable communications in the presence of failures, ACM Trans. Comput. Syst. 5(1) (February 1987) 47–76.
K.P. Birman and T.A. Joseph, Exploiting replication in distributed systems, in: Distributed Systems, ed. S. Mullender (Addison-Wesley, New York, 1989).
G.H. Forman and J. Zahorjan, The challenges of mobile computing, IEEE Computers 27(4) (April 1994) 38–47.
J. Ioannidis, D. Duchamp and G.Q. Maruire Jr., IP-based protocols for mobile internetworking, in: Proc. ACM SIGCOMM Symposium on Communication Architecture and Protocols (1991) pp. 235–245.
L. Lamport, Time, clocks, and the ordering of events in a distributed system, Comm. ACM 21(7) (July 1978) 538–565.
V.O.K. Li and X. Qiu, Personal communication systems (PCS), Proceedings of the IEEE 83(9) (September 1995) 1210–1243.
F. Mattern, Virtual time and global states of distributed systems, in: Proc. International Workshop on Parallel and Distributed Algorithms, eds. M. Cosnard, Y. Robert, P. Quinton and M. Raynal (North-Holland, Elsevier Science, 1989) pp. 215–226.
S. Mishra, L. Peterson and R. Schlicting, Implementing fault-tolerant replicated objects using Psync, in: Proc. 14th Symposium on Operating System Principles, Asheville, North Carolina (December 1993).
A. Mostefaoui and M. Raynal, Causal multicasts in overlapping groups: towards a low cost approach, in: Proc. 4th Workshop on Future Trends of Distributed Computing Systems, Lisbon, Portugal (September 1993) pp. 136–142.
C. Perkins, A. Myles and D.B. Johnson, IMHP: a mobile host protocol for the Internet, Computer Networks and ISDN Systems 27 (1994) 479–491.
R. Prakash, M. Raynal and M. Singhal, An efficient causal ordering algorithm for mobile computing environments, Technical Report OSU-CISRC-TR44, Department of Computer and Information Science, Ohio State University (1995).
R. Prakash and M. Singhal, Low-cost checkpointing and failure recovery in mobile computing systems, Technical Report OSU-CISRC-6/94-TR36, Department of Computer and Information Science, Ohio State University (1994).
M. Raynal, A. Schiper and S. Toueg, The causal ordering abstraction and a simple way to implement it, Inform. Process. Lett. 39 (September 1991) 343–350.
L.E. Rodrigues and P. Verissimo, Causal separators for large-scale multicast communication, in: Proc. 15th International Conference on Distributed Computing Systems (June 1995) pp. 83–91.
A. Schiper, J. Eggli and A. Sandoz, A new algorithm to implement causal ordering, in: Proc. 3rd International Workshop on Distributed Algorithms, 1989. Also published in Lecture Notes in Computer Science 392.
A.S. Tanenbaum, Computer Networks (Prentice-Hall, Englewood Cliffs, NJ, 2nd ed., 1988) chapter 4, pp. 223–239.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yen, L., Huang, T. & Hwang, S. A protocol for causally ordered message delivery in mobile computing systems. Mobile Networks and Applications 2, 365–372 (1997). https://doi.org/10.1023/A:1013613607398
Issue Date:
DOI: https://doi.org/10.1023/A:1013613607398