Two parallel queues with dynamic routing under a threshold-type scheduling
暂无分享,去创建一个
The authors propose two parallel M/M/1 queuing systems with dynamic routing under threshold-type scheduling. An arriving customer is sent to the buffer of the fast server as long as the difference of two queues does not exceed a threshold value: the customer should be sent to the buffer of the slower server if and only if the difference of two queues exceeds a threshold value. It is shown that the two parallel M/M/1 queuing systems under threshold-type scheduling can reduce the mean queuing time compared to conventional parallel M/M/1 queuing systems not using the threshold-type policy, and that the mean queuing time is minimized by selecting the threshold value appropriately.<<ETX>>
[1] Ilias Iliadis,et al. Resequencing delay for a queueing system with two heterogeneous servers under a threshold-type scheduling , 1988, IEEE Trans. Commun..
[2] Charles Knessl,et al. Two Parallel Queues with Dynamic Routing , 1986, IEEE Trans. Commun..
[3] P. R. Kumar,et al. Optimal control of a queueing system with two heterogeneous servers , 1984 .
[4] J. Kingman. Two Similar Queues in Parallel , 1961 .