A diffusion approximation for a GI/GI/1 queue with balking or reneging

被引:81
作者
Ward, AR [1 ]
Glynn, PW
机构
[1] Georgia Inst Technol, Sch Ind & Syst Engn, Atlanta, GA 30332 USA
[2] Stanford Univ, Dept Management Sci & Engn, Stanford, CA 94305 USA
关键词
deadlines; reneging; balking; impatience; GI/GI/1-GI queue; Ornstein-Uhlenbeck process; regulated diffusion; reflected diffusion;
D O I
10.1007/s11134-005-3282-3
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Consider a single-server queue with a renewal arrival process and generally distributed processing times in which each customer independently reneges if service has not begun within a generally distributed amount of time. We establish that both the workload and queue-length processes in this system can be approximated by a regulated Ornstein-Uhlenbeck (ROU) process when the arrival rate is close to the processing rate and reneging times are large. We further show that a ROU process also approximates the queue-length process, under the same parameter assumptions, in a balking model. Our balking model assumes the queue-length is observable to arriving customers, and that each customer balks if his or her conditional expected waiting time is too large.
引用
收藏
页码:371 / 400
页数:30
相关论文
共 26 条
[1]  
Ancker Jr C.J., 1962, J IND ENG, V13, P84
[2]   SINGLE-SERVER QUEUES WITH IMPATIENT CUSTOMERS [J].
BACCELLI, F ;
BOYER, P ;
HEBUTERNE, G .
ADVANCES IN APPLIED PROBABILITY, 1984, 16 (04) :887-905
[3]  
BROWN LD, 2002, STAT ANAL TELEPHONE
[4]  
Browne S., 1995, ADV QUEUEING THEORY, P463
[5]  
CHEN H, 1990, GEN REGULATED MAPPIN
[6]  
Chen H., 2001, Fundamentals of Queueing Networks: Performance, Asymptotics, and Optimization
[7]   PROCESSOR-SHARED BUFFERS WITH RENEGING [J].
COFFMAN, EG ;
PUHALSKII, AA ;
REIMAN, MI ;
WRIGHT, PE .
PERFORMANCE EVALUATION, 1994, 19 (01) :25-46
[8]  
Doytchinov B, 2001, ANN APPL PROBAB, V11, P332
[9]  
GAMARNIK D, 2004, VALIDITY HEAVY TRAFF
[10]  
Garnett O., 2002, Manufacturing & Service Operations Management, V4, P208, DOI 10.1287/msom.4.3.208.7753