Now showing items 1-4 of 4
Controlling the workload of M/G/1 queues via the q-policy
We consider a single-server queueing system with Poisson arrivals and generally distributed service times. To systematically control the workload of the queue, we define for each busy period an associated timer process, ...
On a general mixed priority queue with server discretion
(Taylor & Francis, 2016-10-01)
We consider a single-server queueing system which attends to N priority classes that are classified into two distinct types: (i) urgent: classes which have preemptive resume priority over at least one lower priority class, ...
Waiting Time Distributions in the Preemptive Accumulating Priority Queue
We consider a queueing system in which a single server attends to N priority classes of customers. Upon arrival to the system, a customer begins to accumulate priority linearly at a rate which is distinct to the class to ...
A Generalization of M/G/1 Priority Models via Accumulating Priority
(University of Waterloo, 2016-01-08)
Priority queueing systems are oftentimes set up so that arriving customers are placed into one of $N$ distinct priority classes. Moreover, to determine the order of service, each customer (upon arriving to the system) is ...