Approximations for Markovian multi-class queues with preemptive priorities

Approximations for Markovian multi-class queues with preemptive priorities

0.00 Avg rating—0 Votes
Article ID: iaor20043379
Country: Netherlands
Volume: 32
Issue: 3
Start Page Number: 273
End Page Number: 282
Publication Date: May 2004
Journal: Operations Research Letters
Authors: , ,
Keywords: markov processes
Abstract:

We discuss the approximation of performance measures in multi-class M/M/k queues with preemptive priorities for large problem instances (many classes and servers) using class aggregation and server reduction. We compared our approximations to exact and simulation results and found that our approach yields small-to-moderate approximation errors.

Reviews

Required fields are marked *. Your email address will not be published.