MANY-SERVER HEAVY-TRAFFIC LIMIT FOR QUEUES WITH TIME-VARYING PARAMETERS

被引:35
|
作者
Liu, Yunan [1 ]
Whitt, Ward [2 ]
机构
[1] N Carolina State Univ, Dept Ind & Syst Engn, Raleigh, NC 27695 USA
[2] Columbia Univ, Dept Ind Engn & Operat Res, New York, NY 10027 USA
来源
ANNALS OF APPLIED PROBABILITY | 2014年 / 24卷 / 01期
基金
美国国家科学基金会;
关键词
Many-server queues; queues with time-varying arrivals; nonstationary queues; customer abandonment; nonexponential patience distribution; heavy traffic; functional central limit theorem; Gaussian approximation; deterministic fluid approximation; MULTISERVER QUEUES; APPROXIMATIONS;
D O I
10.1214/13-AAP927
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
A many-server heavy-traffic FCLT is proved for the Gt/M/st + GI queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment according to a general probability distribution. The FCLT provides theoretical support for the approximating deterministic fluid model the authors analyzed in a previous paper and a refined Gaussian process approximation, using variance formulas given here. The model is assumed to alternate between underloaded and overloaded intervals, with critical loading only at the isolated switching points. The proof is based on a recursive analysis of the system over these successive intervals, drawing heavily on previous results for infinite-server models. The FCLT requires careful treatment of the initial conditions for each interval.
引用
收藏
页码:378 / 421
页数:44
相关论文
共 50 条
  • [1] A NEW HEAVY-TRAFFIC LIMIT-THEOREM FOR MANY-SERVER QUEUES
    HALFIN, S
    WHITT, W
    [J]. ADVANCES IN APPLIED PROBABILITY, 1980, 12 (02) : 295 - 295
  • [2] Heavy-traffic limits for many-server queues with service interruptions
    Pang, Guodong
    Whitt, Ward
    [J]. QUEUEING SYSTEMS, 2009, 61 (2-3) : 167 - 202
  • [3] Heavy-traffic limits for many-server queues with service interruptions
    Guodong Pang
    Ward Whitt
    [J]. Queueing Systems, 2009, 61 : 167 - 202
  • [4] HEAVY-TRAFFIC LIMITS FOR WAITING TIMES IN MANY-SERVER QUEUES WITH ABANDONMENT
    Talreja, Rishi
    Whitt, Ward
    [J]. ANNALS OF APPLIED PROBABILITY, 2009, 19 (06): : 2137 - 2175
  • [5] Martingale proofs of many-server heavy-traffic limits for Markovian queues
    Pang, Guodong
    Talreja, Rishi
    Whitt, Ward
    [J]. PROBABILITY SURVEYS, 2007, 4 : 193 - 267
  • [6] ON MANY-SERVER QUEUES IN HEAVY TRAFFIC
    Puhalskii, Anatolii A.
    Reed, Josh E.
    [J]. ANNALS OF APPLIED PROBABILITY, 2010, 20 (01): : 129 - 195
  • [7] Efficiency-driven heavy-traffic approximations for many-server queues with abandonments
    Whitt, W
    [J]. MANAGEMENT SCIENCE, 2004, 50 (10) : 1449 - 1461
  • [8] Validity of heavy-traffic steady-state approximations in many-server queues with abandonment
    J. G. Dai
    A. B. Dieker
    Xuefeng Gao
    [J]. Queueing Systems, 2014, 78 : 1 - 29
  • [9] Algorithms for Time-Varying Networks of Many-Server Fluid Queues
    Liu, Yunan
    Whitt, Ward
    [J]. INFORMS JOURNAL ON COMPUTING, 2014, 26 (01) : 59 - 73
  • [10] Validity of heavy-traffic steady-state approximations in many-server queues with abandonment
    Dai, J. G.
    Dieker, A. B.
    Gao, Xuefeng
    [J]. QUEUEING SYSTEMS, 2014, 78 (01) : 1 - 29