Simple form control policies for resource sharing networks with HGI performance

DOI10.1214/23-AAP1979MaRDI QIDQ6126789zbMATH OpenOpenAlexFDO

Authors Amarjit Budhiraja, Dane Johnson

Publication date 10 April 2024

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

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

zbMATH Keywords

asymptotic optimalityBrownian control problemsdiffusion approximationsdynamic controlheavy trafficinternet flowsreflected Brownian motionsresource sharing networksstochastic processing networks

Mathematics Subject Classification ID

Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Stochastic scheduling theory in operations research (90B36)

Recommendations

• Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks
• Resource sharing networks and Brownian control problems
• Resource sharing networks: overview and an open problem
• Fluid model for a network operating under a fair bandwidth-sharing policy.
• Ergodic control of resource sharing networks: lower bound on asymptotic costs

Cites work

• A large deviations approach to asymptotically optimal control of crisscross network in heavy traffic
• Bandwidth sharing and admission control for elastic traffic
• Brownian models of open processing networks: Canonical representation of workload.
• Brownian models of open queueing networks with homogeneous customer populations^∗
• Construction of asymptotically optimal control for crisscross network from a free boundary problem
• Control Policies Approaching Hierarchical Greedy Ideal Performance in Heavy Traffic for Resource Sharing Networks
• Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy
• Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy
• Heavy traffic analysis of open processing networks with complete resource pooling: asymptotic optimality of discrete review policies
• scientific article; zbMATH DE number 3951715 (Why is no real title available?)
• scientific article; zbMATH DE number 51724 (Why is no real title available?)
• scientific article; zbMATH DE number 1354815 (Why is no real title available?)
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Resource sharing networks: overview and an open problem
• State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy

Cited in

(3)

• Ergodic control of resource sharing networks: lower bound on asymptotic costs
• Fluctuations of the Atlas model from inhomogeneous stationary profiles
• Flocking under fast and large jumps: stability, chaos, and traveling waves

This page was built for publication: Simple form control policies for resource sharing networks with HGI performance

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