English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We study the infinite horizon optimal control problem for N-network queueingsystems, which consist of two customer classes and two server pools, underaverage (ergodic) criteria in the Halfin-Whitt regime. We consider threecontrol objectives: 1) minimizing the queueing (and idleness) cost, 2)minimizing the queueing cost while imposing a constraint on idleness at eachserver pool, and 3) minimizing the queueing cost while requiring fairness onidleness. The running costs can be any nonnegative convex functions having atmost polynomial growth.  For all three problems we establish asymptotic optimality, namely, theconvergence of the value functions of the diffusion-scaled state process to thecorresponding values of the controlled diffusion limit. We also present asimple state-dependent priority scheduling policy under which thediffusion-scaled state process is geometrically ergodic in the Halfin-Whittregime, and some results on convergence of mean empirical measures whichfacilitate the proofs.

Infinite Horizon Average Optimality of the N-network Queueing Model in the Halfin-Whitt Regime