Causal Ordering in Distributed Mobile Systems
IEEE Transactions on Computers - Special issue on mobile computing
Real-Time Dependable Channels: Customizing QoS Attributes for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
The Journal of Supercomputing
Stabilizing Causal Deterministic Merge
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Group Communication Protocol for Multimedia Applications
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Group Protocol for Inter-Object Communications
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Mobi_Causal: a protocol for causal message ordering in mobile computing systems
ACM SIGMOBILE Mobile Computing and Communications Review
Streaming with causality: a practical approach
Proceedings of the 13th annual ACM international conference on Multimedia
Bias in parallel and distributed simulation systems
WSC '05 Proceedings of the 37th conference on Winter simulation
Stabilizing causal deterministic merge
Journal of High Speed Networks - Self-Stabilizing Systems, Part 2
RMTP: a reliable multicast transport protocol
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Causally ordered delivery of multimedia objects
Computer Communications
Dynamical grouping model for distributed real time causal ordering
Computer Communications
| Hi-index | 0.00 |
Abstract: In multimedia systems, not only do messages that are sent to and received by multiple sites need to have a consistent order imposed by all sites, but cause and effect relations must be maintained. Causal ordering allows the cause and effect relations of messages to be maintained. This paper presents an algorithm that insures that multimedia data with real-time deadlines are delivered to the application layer in causal order. The algorithm is designed to insure 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.