Stationary analysis of the 'Shortest Queue First' service policy: The asymmetric case

摘要

The Shortest Queue First service discipline is analyzed for two asymmetric queues. For Poisson job arrivals and exponentially distributed service times, we first show that the Laplace transform of workloads in each queue is related to the solution M of a two-dimensional functional equation