Least Busy Alternative Routing in Queueing and Loss Networks
- 27 July 1992
- journal article
- research article
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 6 (4) , 439-456
- https://doi.org/10.1017/s0269964800002667
Abstract
This paper is divided into two distinct parts: the first considers a loss network, the second a queueing network. In each case, we consider a fully connected network consisting of a large number of links (queues) and operating under a dynamic routing policy known as least busy alternative routing. Using weak convergence results, we can examine the behavior of the networks as the number of links (queues) increases to infinity. We find that, despite the models having similarities and being amenable to the same analytical tools, they exhibit important differences in character.Keywords
This publication has 6 references indexed in Scilit:
- Dynamic routing in open queueing networks: Brownian models, cut constraints and resource poolingQueueing Systems, 1993
- A Limit Result Respecting Graph Structure for a Fully Connected Loss Network with Alternative RoutingThe Annals of Applied Probability, 1991
- Loss NetworksThe Annals of Applied Probability, 1991
- Dynamic Routing in Fully Connected NetworksIMA Journal of Mathematical Control and Information, 1990
- Open Queueing Networks in Heavy TrafficMathematics of Operations Research, 1984
- Equilibria for diffusion models of pairs of communicating computers--Symmetric caseIEEE Transactions on Information Theory, 1982