Ergodic control of resource sharing networks: lower bound on asymptotic costs

Amarjit Budhiraja (), Michael Conroy () and Dane Johnson ()
Additional contact information
Amarjit Budhiraja: University of North Carolina
Michael Conroy: Clemson University
Dane Johnson: Elon University

Queueing Systems: Theory and Applications, 2024, vol. 108, issue 3, No 3, 275-320

Abstract: Abstract Dynamic capacity allocation control for resource sharing networks (RSN) is studied when the networks are in heavy traffic. The goal is to minimize an ergodic cost with a linear holding cost function. Our main result shows that the optimal cost associated with an associated Brownian control problem provides a lower bound for the asymptotic ergodic cost in the RSN for any sequence of control policies. A similar result for an infinite horizon discounted cost has been previously shown for general resource sharing networks in Budhiraja and Conroy (in Modeling, stochastic control, optimization, and applications, 2019) and for general ‘unitary networks’ in Budhiraja and Ghosh (Ann Appl Probab 16:1962–2006, 2006). The study of an ergodic cost criterion requires different ideas as bounds on ergodic costs only yield an estimate on the controls in a time-averaged sense which makes the time-rescaling ideas of Budhiraja and Conroy (in Modeling, stochastic control, optimization, and applications, 2019) and Budhiraja and Ghosh (Ann Appl Probab 16:1962–2006, 2006) hard to implement. Proofs rely on working with a weaker topology on the space of controlled processes that is more amenable to an analysis for the ergodic cost. As a corollary of the main result, we show that the explicit policies constructed in Budhiraja and Johnson (Math Oper Res 45:797–832, 2020; Ann Appl Probab 34:851–916, 2024) for general RSN are asymptotically optimal for the ergodic cost when the underlying cost per unit time has certain monotonicity properties.

Keywords: Ergodic control; Heavy traffic; Resource sharing networks; Bandwidth sharing; Queuing networks; Brownian control problems; Reflected Brownian motion; Hierarchical greedy ideal; Primary 60K20; 68M20; 90B22; Secondary 60J70 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-024-09916-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:108:y:2024:i:3:d:10.1007_s11134-024-09916-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-024-09916-z

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().