Introduction to algorithms
The causal ordering abstraction and a simple way to implement it
Information Processing Letters
An efficient implementation of vector clocks
Information Processing Letters
A Total Ordering Multicast Protocol Using Propagation Trees
IEEE Transactions on Parallel and Distributed Systems
A classification of multicast mechanisms: implementations and applications
Journal of Systems and Software
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Communication Networks: Fundamental Concepts and Key Architectures
Communication Networks: Fundamental Concepts and Key Architectures
RMP: Fault-Tolerant Group Communication
IEEE Micro
Causally Ordering Group Communication Protocol
Proceedings of the 1994 International Conference on Parallel and Distributed Systems
Shrinking Timestamp Sizes of Event Ordering Protocols
ICPADS '98 Proceedings of the 1998 International Conference on Parallel and Distributed Systems
Deadline-Constrained Causal Order
ISORC '00 Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
TCP/IP Protocol Suite
Multicast transport protocols: a survey and taxonomy
IEEE Communications Magazine
Δ-Causality and ε-delivery for wide-area group communications
Computer Communications
Multipoint communication: a survey of protocols, functions, and mechanisms
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Most of existing causal ordering protocols employ the passive message ordering (PMO) approach, which passively re-orders the disturbed messages at destinations. Since the PMO approach cannot prevent disturbance of message ordering, seriously disturbed messages can overrun the receiving buffer of these protocols and cause damaging message loss. This paper proposes the adaptive message scheduling (AMS) approach, which introduces scheduling latency for messages at sources to alleviate the disturbance of message ordering at destinations. We develop a theoretical base for calculating the value of scheduling latency. The scheduling latency can adapt to varying channel latency and is related to the message ordering relation and the message lifetime. We then describe a new protocol that employs the AMS approach. On basis of a proposed model for evaluating group communication protocols, we conduct experiments and simulations to validate the AMS approach. The simulation results show that the AMS approach can effectively improve the ordering latency and reduce the receiving buffer size. A small penalty of employing the AMS approach is a larger loss ratio if strict real-time delivery of messages is to be guaranteed.