Two M/M/1 Queues with Transfers of Customers

Authors:
Qi-Ming He;Marcel F. Neuts
Affiliations:
Department of Industrial Engineering, Dalhousie University, Halifax, NS, Canada B3J 2X4;Department of Systems and Industrial Engineering, University of Arizona, Tucson, AZ 85721, USA
Venue:
Queueing Systems: Theory and Applications
Year:
2002

Citing 2
Cited 4

Deciding which queue to join: Some counterexamples

Operations Research
Optimal dynamic assignment of customers to heterogeneous servers in parallel

Operations Research

Tail behavior for many server queueing model with join the shortest queue discipline and jockeying

Proceedings of the 4th International Conference on Queueing Theory and Network Applications
A simple heuristic for load balancing in parallel processing networks with highly variable service time distributions

Queueing Systems: Theory and Applications
Queues with boundary assistance: the effects of truncation

Queueing Systems: Theory and Applications
Asymptotic behavior for MAP/PH/c queue with shortest queue discipline and jockeying

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a system consisting of two M/M/1 queues with transfers of customers. In that system, when the difference of the queue lengths reaches L (0), a batch of K (0KL) customers is transferred from the longer to the shorter queue. A quasi birth-and-death Markov process describes the queueing process of the two queues. By using the mean-drift method, a simple condition for system stability is found. For the stationary distribution of the queueing process, a matrix geometric solution is obtained. It is shown that the stationary distribution of the total number of customers in the system decays exponentially. The decay rate is found explicitly. Results on the busy periods of the queueing system are also obtained. By using these theoretical results, we numerically explore the optimal design of such queueing systems in terms of customer transfer rates, the batch size of transfer, throughputs, arrival rates, and service rates. In particular, we observe that a balanced queueing system has a total transfer rate that is either the smallest or close to the smallest. We also observe that for system optimization with respect to system descriptors such as the total transfer rate, the mean total queue length, or the system idle probability, the choice of the batch size K has much to do with the difference of the relative traffic intensities of the two M/M/1 queues.