Analysis of a discrete multipriority queueing system involving a central shared processor serving many local queues

The authors consider a multipriority queuing system which involves several distributed local queues and a central server which performs round-robin processor sharing (RRPS). This queuing model, referred to as multiqueue processor sharing (MPS), is an extension of Kleinrock´s classical processor sharing model with generalization to multiple priorities and the addition of a buffer at each traffic source for each priority to buffer additional packets queued at that source. The authors present an exact analysis of the MPS model which leads to a closed-form result for the mean packet delay as a function of the packet length for each priority. It is demonstrated by simulation that the result obtained is applicable for accurately computing the average packet delay for a DQDB (distributed queue dual bus) subnetwork, given that stations transmitting on the same bus are not widely separated