Asymptotic optimality of tracking policies in stochastic networks.

DOI10.1214/aoap/1019487606zbMath1057.90003OpenAlexW2070403440MaRDI QIDQ1872471

Nicole Bäuerle

Publication date: 6 May 2003

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

Full work available at URL: https://doi.org/10.1214/aoap/1019487606

zbMATH Keywords

weak convergenceMarkov decision processfluid modelstochastic orderingsStochastic network

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Markov and semi-Markov decision processes (90C40)

Related Items (17)

Dynamic Server Assignment in Multiclass Queues with Shifts, with Applications to Nurse Staffing in Emergency Departments ⋮ Fluid analysis of an input control problem ⋮ LIQUIDATION IN LIMIT ORDER BOOKS WITH CONTROLLED INTENSITY ⋮ Queueing Network Controls via Deep Reinforcement Learning ⋮ Joint routing and scheduling control in a two-class network with a flexible server ⋮ Weak convergence and fluid limits in optimal time-to-empty queueing control problems ⋮ Large-deviations analysis of the fluid approximation for a controllable tandem queue ⋮ Asymptotic Fluid Optimality and Efficiency of the Tracking Policy for Bandwidth-Sharing Networks ⋮ On the accuracy of fluid approximations to a class of inventory-level-dependent EOQ and EPQ models ⋮ An Overview for Markov Decision Processes in Queues and Networks ⋮ Fluid limits of optimally controlled queueing networks ⋮ Accuracy of fluid approximations to controlled birth-and-death processes: absorbing case ⋮ An analytic framework to develop policies for testing, prevention, and treatment of two-stage contagious diseases ⋮ Asymptotically optimal parallel resource assignment with interference ⋮ Asymptotically optimal index policies for an abandonment queue with convex holding cost ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks ⋮ A Restless Bandit Model for Resource Allocation, Competition, and Reservation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Stochastic optimal control. The discrete time case
• The advantage of small machines in a stochastic fluid production process
• Optimal control of single-server fluid networks
• A survey of Markov decision models for control of networks of queues
• Value iteration and optimization of multiclass queueing networks
• On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
• Fluid approximations and stability of multiclass queueing networks: Work-conserving disciplines
• Convergence to equilibria for fluid models of FIFO queueing networks
• Performance evaluation of scheduling control of queueing networks: Fluid model heuristics
• An algorithm for minimum wait draining of two-station fluid re-entrant line
• Ergodicity of stochastic processes describing the operation of open queueing networks
• Fluctuation smoothing policies are stable for stochastic re-entrant lines
• Bayesian dynamic programming
• A New Algorithm for State-Constrained Separated Continuous Linear Programs
• Analysis of Simple Algorithms for Dynamic Load Balancing
• Forms of Optimal Solutions for Separated Continuous Linear Programs
• Numerical Methods for Stochastic Control Problems in Continuous Time
• Convergence of stochastic processes

This page was built for publication: Asymptotic optimality of tracking policies in stochastic networks.