Abstract
Messages that are sent to and received by multiple sites need to have a consistent order imposed by all sites. Causal ordering allows the cause and effect relations of messages to be maintained. This paper presents an algorithm that ensures that multimedia data with real‐time deadlines are delivered to the application layer in causal order. The algorithm is designed to ensure that any message that arrives at a destination site before its deadline will be delivered to the application before the message expires. In addition, by focusing on a form of causal ordering violations caused by “the triangle inequality”, this algorithm has a low overhead with respect to the amount of information that must be appended to each message.
Similar content being viewed by others
References
R. Baldoni, A. Mostefaoui and M. Raynal, Efficient causally ordered communications for multimedia real-time applications, in: Proceedings of the Fourth IEEE International Symposium on High Performance Distributed Computing, Pentagon City, VA, USA (August 1995).
K. Birman, A. Schiper and P. Stephenson, Lightweight causal and atomic group multicast, ACM Transactions on Computer Systems 9(3) (1991) 282–314.
Computer 24(10) (special issue on multimedia information systems) (October 1991).
D. Ferrari, Client requirement for real-time communication services, IEEE Communications Magazine (November 1990) 65–72.
R. Gusella and S. Zatti, The accuracy of the clock synchronization achieved by TEMPO in Berkeley UNIX 4.3BSD, IEEE Transactions on Software Engineering 15(7) (July 1989) 847–853.
IEEE Journal on Selected Areas in Communication 8(3) (special issue on multimedia) (April 1990).
L. Lamport, Time, clocks, and the ordering of events in a distributed systems, Communications of the ACS 21(7) (July 1978) 558–565.
F. Mattern, Virtual time and global states of distributed systems, in: Proceedings of the International Workshop on Parallel and Distributed Algorithms, Amsterdam (1989) pp. 215–226.
D. Mills, Internet time synchronization: the network time protocol, IEEE Transactions on Communications 39(10) (October 1991) 1482–1493.
A. Schiper, J. Eggli and A. Sandoz, A new algorithm to implement causal ordering, in: Proceedings of the International Workshop on Distributed Algorithms, 1989, Lecture Notes in Computer Science 392 (Springer, New York, 1989) pp. 219–232.
M. Singhal and A. Kshemkalyani, An efficient implementation of vector clocks, Information Processing Letters 43 (August 1992) 47–52.
R. Yavatkar, MCP: A protocol for coordination and temporal synchronization in multimedia collaborative applications, in: Proceedings of 12th International Conference on Distributed Computing Systems (1992).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Adelstein, F., Singhal, M. Real‐time causal message ordering in multimedia systems. Telecommunication Systems 7, 59–74 (1997). https://doi.org/10.1023/A:1019107925532
Issue Date:
DOI: https://doi.org/10.1023/A:1019107925532