Analysis of a Discrete Multipriority Queueing System Involving a Central Shared Processor Serving Many Local Queues

In this paper, we consider a multipriority queueing system which involves several distributed local queues and a central server which performs round robin processor sharing (RRPS). This queueing model, which we call 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 1 source. We 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. We demonstrate by simulation that the ‘ result obtained here is applicable for accurately computing the average ‘ packet delay for a DQDB subnetwork, given that stations transmitting i on the same bus are not widely separated. © 1991 IEEE