1996
DOI: 10.1137/s0363012994265882
|View full text |Cite
|
Sign up to set email alerts
|

Heavy Traffic Convergence of a Controlled, Multiclass Queueing System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

1
51
1

Year Published

2001
2001
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 75 publications
(53 citation statements)
references
References 28 publications
1
51
1
Order By: Relevance
“…However, for many singular control problems in reversible investment and in areas such as queuing and wireless communications (Martins, Shreve, and Soner (1996); Assaf (1997); Harrison and Van Mieghem (1997); Ata, Harrison, and Shepp (2005)), there is no regularity for either the value function or the boundaries. Therefore, two important mathematical issues remain: 1) necessary conditions for regularity properties; and 2) characterization for the value function and for the action and no-action regions when these regularity conditions fail.…”
Section: Introductionmentioning
confidence: 99%
“…However, for many singular control problems in reversible investment and in areas such as queuing and wireless communications (Martins, Shreve, and Soner (1996); Assaf (1997); Harrison and Van Mieghem (1997); Ata, Harrison, and Shepp (2005)), there is no regularity for either the value function or the boundaries. Therefore, two important mathematical issues remain: 1) necessary conditions for regularity properties; and 2) characterization for the value function and for the action and no-action regions when these regularity conditions fail.…”
Section: Introductionmentioning
confidence: 99%
“…In the context of scheduling and queueing problems, the relevant asymptotic regime is the heavy traffic limit, under which the stochastic model can be approximated by either a diffusion process or an ODE system; the limit models are named Brownian network or fluid approximation, depending on whether the limiting differential equation is stochastic or deterministic. Readers interested in the Brownian network approach may consult [23,42,40,36,37,59] and references therein. For the fluid approximation of stochastic queueing networks, we refer to [12,11,40]; cf.…”
Section: Introductionmentioning
confidence: 99%
“…Similarly, by β ≥ 0 we mean that β i ≥ 0, i = 1, 2, where β = (β 1 , β 2 ).] In the queueing network setting this parameter regime corresponds to Case IIB of [20]. In the notation of that paper, 3 correspond to the service rates and c 1 , c 2 , c 3 to the holding costs of the queueing network model.…”
mentioning
confidence: 99%
“…In the notation of that paper, 3 correspond to the service rates and c 1 , c 2 , c 3 to the holding costs of the queueing network model. The parameter regime α ≥ 0, β ≥ 0 (Case IIC of [20]) can be treated in a symmetric manner. Finally, the case α ≥ 0, β ≥ 0 (Case IID of [20]) appears to be a significantly harder problem and is beyond the scope of the current study.…”
mentioning
confidence: 99%