Laws, C. N.; Teh, Y. C. Alternative routeing in fully connected queueing networks. (English) Zbl 0987.90022 Adv. Appl. Probab. 32, No. 4, 962-982 (2000). Summary: We consider a fully connected queueing network in which customers have one direct and many alternative routes through the network, and where customer routeing is dynamic. We obtain an asymptotically optimal routeing policy, taking the limit as the number of queues of the network increases. We observe that good policies route customers directly, unless there is a danger of servers becoming idle, in which case customers should be routed alternatively so as to avoid such idleness, and this leads to policies that perform well in moderate-sized networks. Cited in 2 Documents MSC: 90B22 Queues and service in operations research 60K25 Queueing theory (aspects of probability theory) 90B15 Stochastic network models in operations research Keywords:queueing networks; alternative routeing; optimization; dynamic routeing PDFBibTeX XMLCite \textit{C. N. Laws} and \textit{Y. C. Teh}, Adv. Appl. Probab. 32, No. 4, 962--982 (2000; Zbl 0987.90022) Full Text: DOI