Delay performance in stochastic processing networks with priority service

Authors:
Philipp AfèChe
Affiliations:
Kellogg School of Management, Northwestern University, Evanston, IL 60208-2009, USA
Venue:
Operations Research Letters
Year:
2003

Citing 3
Cited 1

An n-server cutoff priority queue

Operations Research
Modelling a multiprocessor system with preemptive priorities

Management Science
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)

Simulation model driven performance evaluation for enterprise applications

Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

We evaluate the delay performance of an open multi-class stochastic processing network of multi-server resources with preemptive-resume priority service. We show that the stationary distribution of aggregate queue lengths has product form. For each service class we derive explicit expressions for the following stationary performance measures: The mean and, under feedforward routing, the Laplace transform of the delay distribution at each resource. We show that these measures are the same as if the resources were operating in isolation.