Heavy traffic approximations for a system of infinite servers with load balancing

被引:14
作者
Fleming, PJ
Simon, B
机构
[1] Motorola Inc, Arlington Heights, IL 60004 USA
[2] Univ Colorado, Dept Math, Denver, CO 80217 USA
关键词
D O I
10.1017/S0269964899133011
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
We consider an exponential queueing system with multiple stations, each of which has an infinite number of servers and a dedicated arrival stream of jobs. In addition, there is an arrival stream of jobs that choose a station based on the state of the system. In this paper we describe two heavy traffic approximations for the stationary joint probability mass function of the number of busy servers at each station. One of the approximations involves state-space collapse and is accurate for large traffic loads. The state-space in the second approximation does not collapse. It provides an accurate estimate of the stationary behavior of the system over a wide range of traffic loads.
引用
收藏
页码:251 / 273
页数:23
相关论文
共 10 条
[1]  
ALANYALI M, 1996, STOCHASTIC NETWORKS
[2]  
[Anonymous], 1984, MODELLING PERFORMANC
[3]  
BOROVKOV AA, 1967, SIBERIAN MATH J, V8, P746
[4]  
Gardiner C. W, 1997, HDB STOCHASTIC METHO
[5]  
HARIHARAN R, 1990, P 29 IEEE C DEC CONT
[6]  
Iglehart D., 1965, J APPL PROBAB, V2, P429
[7]   A heavy-traffic analysis of a closed queueing system with a GI/infinity service center [J].
Krichagina, EV ;
Puhalskii, AA .
QUEUEING SYSTEMS, 1997, 25 (1-4) :235-280
[8]  
TURNER SRE, 1998, IN PRESS J APPL PROB
[9]  
VITERBI AJ, 1995, DMA PRINCIPLES SPREA
[10]   HEAVY-TRAFFIC APPROXIMATIONS FOR SERVICE SYSTEMS WITH BLOCKING [J].
WHITT, W .
AT&T BELL LABORATORIES TECHNICAL JOURNAL, 1984, 63 (05) :689-708