Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function

DOI10.1214/105051606000000457zbMATH Open1125.60096arXivmath/0702402OpenAlexW3105126597MaRDI QIDQ997413FDOQ997413

Authors: Amarjit Budhiraja, Arka P. Ghosh 

Publication date: 6 August 2007

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: We consider the scheduling control problem for a family of unitary networks under heavy traffic, with general interarrival and service times, probabilistic routing and infinite horizon discounted linear holding cost. A natural nonanticipativity condition for admissibility of control policies is introduced. The condition is seen to hold for a broad class of problems. Using this formulation of admissible controls and a time-transformation technique, we establish that the infimum of the cost for the network control problem over all admissible sequencing control policies is asymptotically bounded below by the value function of an associated diffusion control problem (the Brownian control problem). This result provides a useful bound on the best achievable performance for any admissible control policy for a wide class of networks.

Full work available at URL: https://arxiv.org/abs/math/0702402

Recommendations

• Controlled stochastic networks in heavy traffic: convergence of value functions
• scientific article; zbMATH DE number 4072676
• Ergodic rate control problem for single class queueing networks
• Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality.
• Routing and Singular Control for Queueing Networks in Heavy Traffic

zbMATH Keywords

heavy trafficasymptotic optimalityBrownian control problemcontrol of queueing networksequivalent workload formulationunitary networks

Mathematics Subject Classification ID

Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70) Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Title not available (Why is that?)
• Probability. Theory and examples.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Tightness criteria for laws of semimartingales
• Title not available (Why is that?)
• Random time changes and convergence in distribution under the Meyer-Zheng conditions
• Sequencing and Routing in Multiclass Queueing Networks Part II: Workload Relaxations
• Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
• Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Brownian models of open processing networks: Canonical representation of workload.
• Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
• Two workload properties for Brownian networks
• A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic
• On the Continuity of the Optimal Policy Set for Linear Programs
• Heavy Traffic Analysis of a Controlled Multiclass Queueing Network via Weak Convergence Methods
• Optimal and Approximately Optimal Control Policies for Queues in Heavy Traffic

Cited In (19)

• Optimal control of a time-varying double-ended production queueing model
• Brownian control problems for a multiclass M/M/1 queueing problem with model uncertainty
• Optimal buffer size for a stochastic processing network in heavy traffic
• Controlled stochastic networks in heavy traffic: convergence of value functions
• Existence of optimal controls for singular control problems with state constraints
• Asymptotic analysis of a multiclass queueing control problem under heavy traffic with model uncertainty
• Asymptotic optimality of the generalized \(c\mu\) rule under model uncertainty
• An asymptotic optimality result for the multiclass queue with finite buffers in heavy traffic
• Validity of heavy-traffic steady-state approximations in many-server queues with abandonment
• Construction of asymptotically optimal control for crisscross network from a free boundary problem
• On singular control problems, the time-stretching method, and the weak-M1 topology
• Optimal buffer size and dynamic rate control for a queueing system with impatient customers in heavy traffic
• Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks
• Ergodic control of resource sharing networks: lower bound on asymptotic costs
• Optimal control of a stochastic processing system driven by a fractional Brownian motion input
• Resource sharing networks and Brownian control problems
• Optimal dividend problem: asymptotic analysis
• Diffusion models for double-ended queues with renewal arrival processes
• Parallel server systems under an extended heavy traffic condition: a lower bound

This page was built for publication: Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997413)