Multiple channel queues in heavy traffic. III: random server selection
- 1 January 1970
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 2 (2) , 370-375
- https://doi.org/10.2307/1426325
Abstract
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 pi, p1 + · · · + ps = 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].Keywords
This publication has 4 references indexed in Scilit:
- Weak Convergence of Probability Measures on the Function Space $C\lbrack 0, \infty)$The Annals of Mathematical Statistics, 1970
- Multiple channel queues in heavy traffic. IAdvances in Applied Probability, 1970
- Multiple channel queues in heavy traffic. II: sequences, networks, and batchesAdvances in Applied Probability, 1970
- Weak convergence of stochastic processes defined on semi-infinite time intervalsProceedings of the American Mathematical Society, 1963