Starvation-prevented priority-based total ordering broadcast protocol on high-speed single channel network
- 31 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 281-288
- https://doi.org/10.1109/hpdc.1993.263832
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.<>Keywords
This publication has 19 references indexed in Scilit:
- Message ordering in a multicast environmentPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- An implementation of reliable broadcast using an unreliable multicast facilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Reliable broadcast protocol for selectively partially ordering PDUs (SPO protocol)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A random access algorithm for data networks carrying high priority trafficPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Lightweight causal and atomic group multicastACM Transactions on Computer Systems, 1991
- Group communication in the Amoeba distributed operating systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- A fault-tolerant protocol for atomic broadcastIEEE Transactions on Parallel and Distributed Systems, 1990
- Broadcast protocols for distributed systemsIEEE Transactions on Parallel and Distributed Systems, 1990
- Multiple-access protocols and time-constrained communicationACM Computing Surveys, 1984
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978