TY - JOUR
T1 - Diffusion approximation for fair resource control—interchange of limits under a moment condition
AU - Ye, Heng Qing
AU - Yao, David D.
N1 - Funding Information:
Funding: This work was supported by the National Science Foundation [Grants CMMI-0969328 and CMMI-1462495], the National Natural Science Foundation of China [Grant 71520107003], and the Hong Kong University Grants Committee Research Grants Council [Grant 15508114].
Publisher Copyright:
© 2021 INFORMS.
PY - 2021/8
Y1 - 2021/8
N2 - In a prior study [Ye HQ, Yao DD (2016) Diffusion limit of fair resource control–Stationary and interchange of limits. Math. Oper. Res. 41(4):1161–1207.] focusing on a class of stochastic processing network with fair resource control, we justified the diffusion approximation (in the context of the interchange of limits) provided that the pth moment of the workloads are bounded. To this end, we introduced the so-called bounded workload condition, which requires the workload process be bounded by a free process plus the initial workload. This condition is for a derived process, the workload, as opposed to primitives such as arrival processes and service requirements; as such, it could be difficult to verify. In this paper, we establish the interchange of limits under a moment condition of suitable order on the primitives directly: the required order is p∗ > 2 (p + 2) on the moments of the primitive processes so as to bound the pth moment of the workload. This moment condition is trivial to verify, and indeed automatically holds in networks where the primitives have moments of all orders, for instance, renewal arrivals with phase-type interarrival times and independent and identically distributed phase-type service times.
AB - In a prior study [Ye HQ, Yao DD (2016) Diffusion limit of fair resource control–Stationary and interchange of limits. Math. Oper. Res. 41(4):1161–1207.] focusing on a class of stochastic processing network with fair resource control, we justified the diffusion approximation (in the context of the interchange of limits) provided that the pth moment of the workloads are bounded. To this end, we introduced the so-called bounded workload condition, which requires the workload process be bounded by a free process plus the initial workload. This condition is for a derived process, the workload, as opposed to primitives such as arrival processes and service requirements; as such, it could be difficult to verify. In this paper, we establish the interchange of limits under a moment condition of suitable order on the primitives directly: the required order is p∗ > 2 (p + 2) on the moments of the primitive processes so as to bound the pth moment of the workload. This moment condition is trivial to verify, and indeed automatically holds in networks where the primitives have moments of all orders, for instance, renewal arrivals with phase-type interarrival times and independent and identically distributed phase-type service times.
KW - Diffusion limit
KW - Interchange of limits
KW - Resource-sharing network
KW - Stationary distribution
KW - Uniform stability
UR - http://www.scopus.com/inward/record.url?scp=85113830039&partnerID=8YFLogxK
U2 - 10.1287/MOOR.2020.1065
DO - 10.1287/MOOR.2020.1065
M3 - Journal article
AN - SCOPUS:85113830039
SN - 0364-765X
VL - 46
SP - 869
EP - 894
JO - Mathematics of Operations Research
JF - Mathematics of Operations Research
IS - 3
ER -