A total ordering protocol using a dynamic token-passing scheme

Solutions to the total ordering problem can be used to maintain consistency in distributed system applications such as replicated databases. We propose a total ordering protocol based on a dynamic token-passing scheme which determines the next token holder dynamically, not in predetermined order. The proposed protocol provides fast stability time, uses a small buffer, and distributes evenly the load of ordering messages to accomplish a total message ordering. We present simulation results to illustrate that the performance of the proposed protocol is superior to that of existing token-based total ordering protocols.