APPROXIMATING THE MEAN TIME IN SYSTEM IN A MULTIPLE-SERVER QUEUE THAT USES THRESHOLD SCHEDULING

被引:7
作者
NELSON, R [1 ]
TOWSLEY, D [1 ]
机构
[1] UNIV MASSACHUSETTS,AMHERST,MA 01003
关键词
MATHEMATICAL TECHNIQUES - Approximation Theory - SCHEDULING - Mathematical Models;
D O I
10.1287/opre.35.3.419
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a queueing system consisting of a single queue with multiple exponential servers with different servicing rates. We assume that arrivals to the queue come from a Poisson source and are scheduled according to a threshold policy. Since determining the exact mean time in system appears to be difficult, we present an approximation that yields results very close to those obtained from simulation.
引用
收藏
页码:419 / 427
页数:9
相关论文
共 7 条
[1]  
AGRAWALA AK, 1984, IEEE T COMPUT, V33, P351, DOI 10.1109/TC.1984.1676440
[2]   A SPECTRAL METHOD FOR CONFIDENCE-INTERVAL GENERATION AND RUN LENGTH CONTROL IN SIMULATIONS [J].
HEIDELBERGER, P ;
WELCH, PD .
COMMUNICATIONS OF THE ACM, 1981, 24 (04) :233-245
[3]  
IBE OC, 1982, IBM RC9346 RES REP
[4]  
LIN WE, 1984, IEEE T AUTOMAT CONTR, V29, P696, DOI 10.1109/TAC.1984.1103637
[5]  
NELSON R, 1985, IBM RC11255 RES REP
[6]  
Neuts M. F., 1981, OR Spektrum, V2, P227, DOI 10.1007/BF01721011
[7]   A LANGUAGE FOR EXTENDED QUEUING NETWORK MODELS [J].
SAUER, CH ;
MACNAIR, EA ;
SALZA, S .
IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1980, 24 (06) :747-755