Analysis of a scheduling algorithm for real-time communication

A refined version of a random multiple-access algorithm for time-constrained communication in distributed computing systems is introduced. The performance of the algorithm is analyzed by simulation. The simulation experiment shows that the basic scheduling idea of the algorithm, namely, to reject messages with deadlines earlier than a minimum acceptable deadline, leads to an improvement in the quality of service as measured by the percentage of losses.<
>