论文信息 - Multiple channel queues in heavy traffic. III: random server selection

Multiple channel queues in heavy traffic. III: random server selection

As in [4] and [5], we study service facilities with r arrival channels and s service channels. However, here we assume that customers, immediately upon arrival, randomly select one of the s service channels. Successive customers make this choice independently, choosing server i with probability p i , p 1 + · · · + p s = 1. Customers are then served by the servers they select in order of their arrival without defections. The average processing rates as well as the server selection probabilities may vary from server to server, but again we assume the r arrival channels are independent and independent of the service channels. The service channels are not independent, however, because of the random server selection. For simplicity, we only consider a single queueing system; the extension to sequences follows immediately using the argument of [5].

W. Whitt

[1] Charles Stone. Weak convergence of stochastic processes defined on semi-infinite time intervals , 1963 .

[2] W. Whitt. WEAK CONVERGENCE THEOREMS FOR QUEUES IN HEAVY TRAFFIC. , 1968 .

[3] D. L. Iglehart. Weak convergence of probability measures on product spaces with applications to sums of random vectors , 1968 .

[4] P. Billingsley,et al. Convergence of Probability Measures , 1969 .

[5] D. Iglehart,et al. Multiple channel queues in heavy traffic. II: sequences, networks, and batches , 1970, Advances in Applied Probability.

[6] D. Iglehart,et al. Multiple channel queues in heavy traffic. I , 1970, Advances in Applied Probability.

[7] W. Whitt. Weak Convergence of Probability Measures on the Function Space $C\lbrack 0, \infty)$ , 1969 .

[8] D. Iglehart,et al. The Equivalence of Functional Central Limit Theorems for Counting Processes and Associated Partial Sums , 1971 .