Two parallel queues with dynamic routing under a threshold-typescheduling

摘要

The authors propose two parallel M/M/1 queuing systems withdynamic routing under threshold-type scheduling. An arriving customer issent to the buffer of the fast server as long as the difference of twoqueues does not exceed a threshold value: the customer should be sent tothe buffer of the slower server if and only if the difference of twoqueues exceeds a threshold value. It is shown that the two parallelM/M/1 queuing systems under threshold-type scheduling can reduce themean queuing time compared to conventional parallel M/M/1 queuingsystems not using the threshold-type policy, and that the mean queuingtime is minimized by selecting the threshold value appropriately