A protocol for causally ordered message delivery in mobile computing systems
Mobile Networks and Applications - Special issue on personal communications services
An efficient algorithm for causal messages ordering
Proceedings of the 2001 ACM symposium on Applied computing
Consistency Conditions for a CORBA Caching Service
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Topology-Aware Algorithms for Large-Scale Communication
Advances in Distributed Systems, Advanced Distributed Computing: From Algorithms to Systems
On reducing the complexity of matrix clocks
Parallel Computing
On the interconnection of message passing systems
Information Processing Letters
Parallel Interconnection of Broadcast Systems with Multiple FIFO Channels
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Fast, flexible, and highly resilient genuine fifo and causal multicast algorithms
Proceedings of the 2010 ACM Symposium on Applied Computing
| Hi-index | 0.00 |
Abstract: In recent years there has been a growing interest in developing communication systems that are able to deliver messages respecting potential causality. Unfortunately, causal delivery cannot be provided without costs: extra delays may be induced on message delivery or processes may be required to maintain and exchange records of causal relations. In this paper we present an extension to previous work on compression of causal information using knowledge about the topology of the communication structure. In order to make practical use of this result, we present a methodology to model the communication system. The technique exploits the physical structure of existing networks, in particular its hierarchical nature, to create a communication graph where causal separators match the underlying physical and administrative organization. We show that this approach can be applied to existing large-scale systems, providing the means for using topological timestamping with negligible overhead.