Adding Priorities to Paxos

This paper introduces an advanced implementation of the Paxos consensus algorithm in which proposals have different priority levels so that higher priority proposals preempt lower priority ones to reduce latency. The operation of the protocol is modeled using preemptive priority queues, which allows us to evaluate system performance in a number of different scenarios. Our results indicate that the implementation of the Paxos algorithm in this manner offers tunable differentiation of completion times, making it suitable for a variety of applications, including permissioned blockchains in IoT scenarios.