Resource pooling in queueing networks with dynamic routing

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.

[1]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[2]  S. Vajda,et al.  Integer Programming and Network Flows , 1970 .

[3]  W. Whitt.  Weak convergence theorems for priority queues: preemptive-resume discipline , 1971, Journal of Applied Probability.

[4]  Shaler Stidham,et al.  Technical Note - A Last Word on L = λW , 1974, Oper. Res..

[5]  Robert G. Gallager,et al.  A Minimum Delay Routing Algorithm Using Distributed Computation , 1977, IEEE Trans. Commun..

[6]  G. J. Foschini,et al.  A Basic Dynamic Routing Problem and Diffusion , 1978, IEEE Trans. Commun..

[7]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[8]  M. Minoux.  Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements* , 1981 .

[9]  Martin I. Reiman,et al.  Open Queueing Networks in Heavy Traffic , 1984, Math. Oper. Res..

[10]  Martin I. Reiman,et al.  Some diffusion approximations with state space collapse , 1984 .

[11]  J. Harrison,et al.  Brownian motion and stochastic flow systems , 1986 .

[12]  Ruth J. Williams,et al.  Brownian Models of Open Queueing Networks with Homogeneous Customer Populations , 1987 .

[13]  J. Michael Harrison,et al.  Brownian Models of Queueing Networks with Heterogeneous Customer Populations , 1988 .

[14]  Lawrence M. Wein,et al.  Scheduling networks of queues: Heavy traffic analysis of a simple open network , 1989, Queueing Syst. Theory Appl..

[15]  Joel E. Cohen,et al.  A paradox of congestion in a queuing network , 1990, Journal of Applied Probability.

[16]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network , 1990, Oper. Res..

[17]  C. N. Laws,et al.  Dynamic Scheduling of a Four-Station Queueing Network , 1990, Probability in the Engineering and Informational Sciences.

[18]  L. F. Martins,et al.  Routing and singular control for queueing networks in heavy traffic , 1990 .

[19]  Hong Chen,et al.  Stochastic discrete flow networks : diffusion approximations and bottlenecks , 1991 .

[20]  William P. Peterson,et al.  A Heavy Traffic Limit Theorem for Networks of Queues with Multiple Customer Types , 1991, Math. Oper. Res..