On the value function of a priority queue with an application to a controlled polling model

Authors:
Ger Koole;Philippe Nain
Affiliations:
Vrije Universiteit, De Boelelaan 1081a, 1081 HV Amsterdam, The Netherlands E-mail: koole@cs.vu.nl;INRIA, 2004 Route des Lucioles, 06902 Sophia Antipolis, France E-mail: nain@sophia.inria.fr
Venue:
Queueing Systems: Theory and Applications
Year:
1999

Citing 5
Cited 6

Analysis of polling systems

Analysis of polling systems
Separable routing: a scheme for state-dependent routing of circuit switched telephone traffic

Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Assigning a single server to inhomogeneous queues with switching costs

Theoretical Computer Science
Neuro-Dynamic Programming

Neuro-Dynamic Programming
Value iteration and optimization of multiclass queueing networks

Queueing Systems: Theory and Applications

ON DEVIATION MATRICES FOR BIRTH–DEATH PROCESSES

Probability in the Engineering and Informational Sciences
An Explicit Solution for the Value Function of a Priority Queue

Queueing Systems: Theory and Applications
Dynamic routing policies for multiskill call centers

Probability in the Engineering and Informational Sciences
Controlled jump Markov processes with local transitions and their fluid approximation

WSEAS Transactions on Systems and Control
An analytical approach to the efficient real-time events/services handling in converged network environment

NBiS'07 Proceedings of the 1st international conference on Network-based information systems
On the optimal control of a two-queue polling model

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a closed-form expression for the discounted weighted queue length and switching costs of a two-class single-server queueing model under a preemptive priority rule. These expressions are used to do a single step of policy iteration in a polling model with a dynamically controlled switching rule, starting from the preemptive priority rule. Numerical experiments show that this leads to a policy that performs well.