Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling

1993 ◽  
Vol 13 (1-3) ◽  
pp. 47-86 ◽  
Author(s):  
F. P. Kelly ◽  
C. N. Laws
Keyword(s):  
Queueing Networks ◽  
Dynamic Routing ◽  
Resource Pooling ◽  
Open Queueing Networks ◽  
Brownian Models

Resource pooling in queueing networks with dynamic routing

1992 ◽  
Vol 24 (3) ◽  
pp. 699-726 ◽  
Author(s):  
C. N. Laws
Keyword(s):  
Optimal Control ◽  
Brownian Motion ◽  
Optimal Control Problem ◽  
Queueing Networks ◽  
Heavy Traffic ◽  
Queueing Network ◽  
Original System ◽  
Dynamic Routing ◽  
Resource Pooling ◽  
Service Stations

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.

Resource pooling in queueing networks with dynamic routing

1992 ◽  
Vol 24 (03) ◽  
pp. 699-726 ◽  
Author(s):  
C. N. Laws
Keyword(s):  
Optimal Control ◽  
Brownian Motion ◽  
Optimal Control Problem ◽  
Queueing Networks ◽  
Heavy Traffic ◽  
Queueing Network ◽  
Original System ◽  
Dynamic Routing ◽  
Resource Pooling ◽  
Service Stations

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.

Sign in / Sign up

Export Citation Format

Share Document