Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks
DOI10.1287/moor.2019.1007zbMath1451.90073arXiv1710.09042OpenAlexW3016843257MaRDI QIDQ3387903
Dane Johnson, Amarjit Budhiraja
Publication date: 8 January 2021
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.09042
heavy trafficdiffusion approximationsstochastic networksreflected Brownian motionsdynamic controlthreshold policiesBrownian control problemsresource sharing networksInternet flows
Queueing theory (aspects of probability theory) (60K25) Stochastic scheduling theory in operations research (90B36) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70)
Related Items (2)
Cites Work
- Unnamed Item
- Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy
- State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy
- Diffusion approximations for controlled stochastic networks: an asymptotic bound for the value function
- Dynamic control of Brownian networks: State space collapse and equivalent workload formulations
- Brownian models of open processing networks: Canonical representation of workload.
- Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
- Bandwidth sharing and admission control for elastic traffic
- Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
- A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic
- Brownian models of open queueing networks with homogeneous customer populations∗
- On the Continuity of the Optimal Policy Set for Linear Programs
- Resource sharing networks: Overview and an open problem
This page was built for publication: Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks