Analysis of polling systems
Mean waiting times in nonpreemptive priority M/G/1 queues with server switchover times
Proc. of the international seminar on Teletraffic analysis and computer performance evaluation
Modeling and Analysis of Computer Communications Networks
Modeling and Analysis of Computer Communications Networks
Local Networks
| Hi-index | 0.00 |
Analysis is given to a nonpreemptive priority queueing system with P classes of messages where the class of message to be served next is the highest priority class waiting at the time of service start. (If this were the highest priority class waiting at the service completion epoch, we would have a classical nonpreemptive head-of-line priority queueing system.) We assume that the message service time distribution is identical for all classes. The mean message waiting time is obtained explicitly for each class, and numerically compared to the values in the corresponding head-of-line system. We have also proposed and evaluated a fairness measure to demonstrate the degree of discrimination. This model can be applied to the performance analysis of the prioritized token-ring scheme in local area computer networks when the propagation delay and bit latency are negligible compared to the frame transmission time.