Performance of communication and queueing processors under message delay limits

The authors perform an analysis and performance comparison of queueing systems operating under a message waiting-time or a delay-time constraint. Four different system admission and preemption policies are investigated. Under either a wait-time constraint or a delay-time limit, arriving messages are either always admitted (and then properly dismissed if their required residence limits are not met) or a determination is made upon arrival as to whether the new message can be served to completion within its required time limit, and only then is this message admitted. The authors investigate and compare the delay-throughput performance of these admission and service-preemption policies for communications and processing systems modeled as a single server M/G/1 queueing system. The authors also set up a cost function which incorporates cost components for system throughput, as well as for implementing the observation and monitoring function and for message residence times