A direct approach to sojourn times in a busy period of an M/M/1 queue

被引:2
作者
Kherani, Arzad A. [1 ]
机构
[1] Indian Inst Technol, Dept Comp Sci & Engn, New Delhi 110016, India
关键词
M/M/1; queue; busy period; catalan number;
D O I
10.1007/s11134-006-6989-x
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
In this paper we present a direct approach to obtaining joint distributions of various quantities of interest in a busy period in an M/M/1 queue. These quantities are: the sojourn times and waiting times of all the customers in the busy period, the busy period length and the number of customers served in a busy period. Since the evolution of the total workload process between two successive customer arrivals is deterministic, this work gives statistic of the complete evolution of the workload process within a busy period.
引用
收藏
页码:159 / 169
页数:11
相关论文
共 8 条
[1]  
ALHANBALI A, IEEE INFOCOM 2006
[2]  
[Anonymous], 1967, COMBINATORIAL METHOD
[3]  
[Anonymous], 1979, Reversibility and Stochastic Networks
[4]   Services within a busy period of an M/M/1 queue and Dyck paths [J].
Draief, M ;
Mairesse, J .
QUEUEING SYSTEMS, 2005, 49 (01) :73-84
[5]   The formal theory of birth-and-death processes, lattice path combinatorics and continued fractions [J].
Flajolet, P ;
Guillemin, F .
ADVANCES IN APPLIED PROBABILITY, 2000, 32 (03) :750-778
[6]  
IACONO AL, 2001, INFOSTATIONS NEW PER
[7]  
Kleinrock L., 1975, QUEUEING SYSTEMS VOL
[8]  
NAIN P, 2005, IN PRESS IEEE INF 20, P13