Waiting Time Distributions in the Preemptive Accumulating Priority Queue
MetadataShow full item record
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 which it belongs. Customers with greater accumulated priority levels are given preferential treatment in the sense that at every service selection instant, the customer with the greatest accumulated priority level is selected next for servicing. Furthermore, the system is preemptive so that the servicing of a customer is interrupted for customers with greater accumulated priority levels. The main objective of the paper is to characterize the waiting time distributions of each class. Numerical examples are also provided which exemplify the true benefit of incorporating an accumulating prioritization structure, namely the ability to control waiting times.
Cite this version of the work
Val Andrei Fajardo, Steve Drekic (2017). Waiting Time Distributions in the Preemptive Accumulating Priority Queue. UWSpace. http://hdl.handle.net/10012/12058
Showing items related by title, author, creator and subject.
Fajardo, Val Andrei (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 ...
Competition Between Injunctive Social Norms And Conservation Priorities Gives Rise To Complex Dynamics In A Model Of Forest Growth And Opinion Dynamics Sigdel, Ram P.; Anand, Madhur; Bauch, Chris T. (Elsevier, 2017-11-07)Human and environmental systems are often treated as existing in isolation from one another, whereas in fact they are often two parts of a single, coupled human-environment system. Developing theoretical models of coupled ...
Fajardo, Val Andrei; Drekic, Steve (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, ...