UNDERSTANDING THE EFFICIENCY OF MULTISERVER SERVICE SYSTEMS

被引:105
作者
WHITT, W
机构
关键词
QUEUES; MULTISERVER QUEUES; SERVICE SYSTEMS; UTILIZATION; ECONOMY OF SCALE; APPROXIMATIONS; PROBABILITY OF DELAY; PEAKEDNESS; HAYWARD APPROXIMATION;
D O I
10.1287/mnsc.38.5.708
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
In the design and operation of service systems, it is important to determine an appropriate level of server utilization (the proportion of time each server should be working). In a multiserver queue with unlimited waiting space, the appropriate server utilization typically increases as the number of servers (and the arrival rate) increases. We explain this economy of scale and give a rough quantitative characterization. We also show how increased variability in the arrival and service processes tends to reduce server utilization with a given grade of service. As part of this analysis, we develop simple approximations for the mean steady-state waiting time and the full steady-state waiting-time distribution. These approximations exploit an infinite-server approximation for the probability of delay and a single-server approximation for the conditional waiting-time distribution given that waiting occurs. The emphasis is on simple formulas that directly convey understanding.
引用
收藏
页码:708 / 723
页数:16
相关论文
共 31 条
[1]  
Billingsley P, 1968, CONVERGENCE PROBABIL
[2]  
Borovkov A, 1967, SIBERIAN MATH J+, V8, P746
[3]  
ECKBERG AE, 1985, 11TH P INT TEL C KY
[4]  
ECKBERG AE, 1983, 10TH P INT TEL C MON
[5]  
Feller W., 1968, INTRO PROBABILITY TH, V1st
[6]   DEPENDENCE IN PACKET QUEUES [J].
FENDICK, KW ;
SAKSENA, VR ;
WHITT, W .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1989, 37 (11) :1173-1183
[7]   MEASUREMENTS AND APPROXIMATIONS TO DESCRIBE THE OFFERED TRAFFIC AND PREDICT THE AVERAGE WORKLOAD IN A SINGLE-SERVER QUEUE [J].
FENDICK, KW ;
WHITT, W .
PROCEEDINGS OF THE IEEE, 1989, 77 (01) :171-194
[8]   CONGESTION IN BLOCKING SYSTEMS - A SIMPLE APPROXIMATION TECHNIQUE [J].
FREDERICKS, AA .
BELL SYSTEM TECHNICAL JOURNAL, 1980, 59 (06) :805-827
[9]   ORDINARY CLT AND WLLN VERSIONS OF L=LAMBDA-W [J].
GLYNN, PW ;
WHITT, W .
MATHEMATICS OF OPERATIONS RESEARCH, 1988, 13 (04) :674-692
[10]   A NEW VIEW OF THE HEAVY-TRAFFIC LIMIT-THEOREM FOR INFINITE-SERVER QUEUES [J].
GLYNN, PW ;
WHITT, W .
ADVANCES IN APPLIED PROBABILITY, 1991, 23 (01) :188-209