Asymptotic Fluid Optimality and Efficiency of the Tracking Policy for Bandwidth-Sharing Networks
From MaRDI portal
Publication:5391084
DOI10.1239/jap/1300198138zbMath1217.60079OpenAlexW1974167784MaRDI QIDQ5391084
Yi Zhang, Konstantin E. Avrachenkov, Aleksey B. Piunovskiy
Publication date: 5 April 2011
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/jap/1300198138
Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
The transformation method for continuous-time Markov decision processes ⋮ Accuracy of fluid approximations to controlled birth-and-death processes: absorbing case
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Accuracy of fluid approximations to controlled birth-and-death processes: absorbing case
- On the accuracy of fluid approximations to a class of inventory-level-dependent EOQ and EPQ models
- Existence and regularity of a nonhomogeneous transition matrix under measurability conditions
- Random walk, birth-and-death process and their fluid approximations: Absorbing case
- Continuous-time Markov decision processes. Theory and applications
- The spread of epidemics
- Continuous-time Markov chains. An applications-oriented approach
- Large-deviations analysis of the fluid approximation for a controllable tandem queue
- Fluid approximation of a controlled multiclass tandem network
- Bandwidth sharing and admission control for elastic traffic
- Asymptotic optimality of tracking policies in stochastic networks.
- Discrete-review policies for scheduling stochastic networks: trajectory tracking and fluid-scale asymptotic optimality.
- On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
- Fluid limits of optimally controlled queueing networks
- Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations
- The transient solution of time-dependent M/M/1 queues
- Rate of convergence of the fluid approximation for generalized Jackson networks
- Forms of Optimal Solutions for Separated Continuous Linear Programs
This page was built for publication: Asymptotic Fluid Optimality and Efficiency of the Tracking Policy for Bandwidth-Sharing Networks