Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies

Abstract

We consider a class of open stochastic processing networks, with feedback routing and overlapping server capabilities, in heavy traffic. The networks we consider satisfy the so-called complete resource pooling condition and therefore have one-dimensional approximating Brownian control problems. We propose a simple discrete review policy for controlling such networks. Assuming 2+εmoments on the interarrival times and processing times, we provide a conceptually simple proof of asymptotic optimality of the proposed policy.

Published at http://dx.doi.org/10.1214/105051604000000495 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)

Cited by in corpus (7)

• Asymptotic optimality of maximum pressure policies in stochastic processing networks
• Scheduling control for queueing systems with many servers: asymptotic optimality in heavy traffic
• Controlled stochastic networks in heavy traffic: Convergence of value functions
• Diffusion approximations for controlled stochastic networks: An asymptotic bound for the value function
• A Queueing Model of Dynamic Pricing and Dispatch Control for Ride-Hailing Systems Incorporating Travel Times
• Control Policies Approaching HGI Performance in Heavy Traffic for Resource Sharing Networks
• Reflected Brownian Motion in a wedge: sum-of-exponential absorption probability at the vertex and differential properties