Starvation-prevented priority-based total ordering broadcast protocol on high-speed single channel network

Abstract

The authors discuss a distributed broadcast protocol which provides priority-based receipt ordering of protocol data units (PDUs) for the application entities by using the high-speed single-channel network in the presence of the loss of PDUs. There is a starvation problem, i.e. lower-priority PDUs can be left waiting indefinitely in the receipt queue since higher-priority PDUs jump over lower-priority ones. They present a method by which even lower-priority PDUs are delivered to the application entities in some pre-defined time by partitioning the receipt sequence of PDUs into runs, where each runs is priority-based ordered.<>