A Fast Delivery Protocol for Total Order Broadcasting

Abstract—Sequencer, privilege-based, and communication history algorithms are popular approaches to implement total ordering, where communication history algorithms are most suitable for parallel computing systems, because they provide best performance under heavy work load. Unfortunately, posttransmission delay of communication history algorithms is most apparent when a system is idle. In this paper, we propose a fast delivery protocol to reduce the latency of message ordering. The protocol optimizes the total ordering process by waiting for messages only from a subset of the machines in the group, and by fast acknowledging messages on behalf of other machines. Our test results indicate that the fast delivery protocol is suitable for both idle and heavy load systems, while reducing the latency of message ordering.

• Type: Conference
• Year: 2007
• Where: ICCCN
• Authors: Li Ou, Xubin He, Christian Engelmann, Stephen L. Scott
• Keywords: Communication History Algorithms, Fast Delivery Protocol, ICCCN 2007, Total Ordering