Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
type: Item
instance of: scholarly article
title: Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
zbMATH Open document ID: 0885.60080
author: J. Michael Harrison
author: Jan A. Van Mieghem
published in: The Annals of Applied Probability
publication date: 1998-04-20T00:00:00Z
review text: Brownian networks are heavy traffic limits or heavy traffic approximations of queueing network processes or interconnected inventory system processes. The stochastic behaviour of such processes is determined by a multidimensional Brownian motion input process and a control process. These are connected by an input-output matrix, a capacity consumption matrix, and the boundary behaviour (non-negativity) of the processes of interest: Inventory level \(Z\) and cumulative idleness \(U\). Given the initial inventory level, the structure functions, and the Brownian motion, a pair \((Z,U)\) is achievable if there exists a control process whose application results in it. The authors identify a class of control actions called reversible and show that any two state vectors which differ by a reversible displacement only are equivalent with respect to the control problem under consideration. This gives rise to the possibility of reducing the state space of the process by considering only a projection of the process. Control decisions can be based on the projection process only. The main theorem states that any pair \((Z,U)\) is achievable in the original Brownian network iff it is achievable in the reduced network. Several examples are discussed in detail and the authors point out that their results do not use the Brownian motion properties of the driving process.
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 60J70
Mathematics Subject Classification ID: 90B15
zbMATH DE Number: 1080212
zbMATH Keywords: heavy traffic approximation
zbMATH Keywords: equivalent workload
zbMATH Keywords: dynamic routing
reviewed by: Hans Daduna
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/aoap/1034801252
OpenAlex ID: W3121663994
cites work: Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network
cites work: Q3806523
cites work: Q4894801
cites work: Scheduling networks of queues: Heavy traffic analysis of a simple open network
cites work: Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
cites work: Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
cites work: Q4094202
cites work: Routing and Singular Control for Queueing Networks in Heavy Traffic
cites work: Resource pooling in queueing networks with dynamic routing
cites work: Dynamic Scheduling of a Four-Station Queueing Network
cites work: Q3792024
cites work: Q3334756
cites work: Open Queueing Networks in Heavy Traffic
cites work: Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
cites work: Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Network with Controllable Inputs
cites work: Brownian Networks with Discretionary Routing
cites work: Dynamic Scheduling of a Multiclass Make-to-Stock Queue
DOI: 10.1214/AOAP/1034801252
description: scientific article; zbMATH DE number 1080212