Priorities in M/G/1 vacation model with exhaustive p-limited service discipline

M/G/1 vacation models with priorities are useful in modeling computer and communication networks. An M/G/1 vacation model with two priority classes of messages is considered. The policy of the service is exhaustive p-limited discipline and nonpreemptive discipline. Generating functions of steady state queue length at Markov points are derived, and the procedure of computing the mean waiting times of both classes of messages is presented. Numerical results reveal the effect of the probability distribution of limit of service. The results of the authors´ analysis can be applied to performance evaluations of the FDDI (fiber distributed data interface)