Resource pooling in queueing networks with dynamic routing
- 1 September 1992
- journal article
- Published by Cambridge University Press (CUP) in Advances in Applied Probability
- Vol. 24 (3) , 699-726
- https://doi.org/10.2307/1427485
Abstract
In this paper we investigate dynamic routing in queueing networks. We show that there is a heavy traffic limiting regime in which a network model based on Brownian motion can be used to approximate and solve an optimal control problem for a queueing network with multiple customer types. Under the solution of this approximating problem the network behaves as if the service-stations of the original system are combined to form a single pooled resource. This resource pooling is a result of dynamic routing, it can be achieved by a form of shortest expected delay routing, and we find that dynamic routing can offer substantial improvements in comparison with less responsive routing strategies.Keywords
This publication has 17 references indexed in Scilit:
- Stochastic Discrete Flow Networks: Diffusion Approximations and BottlenecksThe Annals of Probability, 1991
- A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer TypesMathematics of Operations Research, 1991
- Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed NetworkOperations Research, 1990
- A paradox of congestion in a queuing networkJournal of Applied Probability, 1990
- Routing and Singular Control for Queueing Networks in Heavy TrafficSIAM Journal on Control and Optimization, 1990
- Optimal Control of a Two-Station Brownian NetworkMathematics of Operations Research, 1990
- Open Queueing Networks in Heavy TrafficMathematics of Operations Research, 1984
- A Minimum Delay Routing Algorithm Using Distributed ComputationIEEE Transactions on Communications, 1977
- Technical Note—A Last Word on L = λWOperations Research, 1974
- Weak convergence theorems for priority queues: preemptive-resume disciplineJournal of Applied Probability, 1971