Services within a busy period of an M/M/1 queue and Dyck paths

被引:6
作者
Draief, M [1 ]
Mairesse, J [1 ]
机构
[1] Univ Paris 07, CNRS, LIAFA, F-75251 Paris 05, France
关键词
M/M/1; queue; busy period; Dyck paths;
D O I
10.1007/s11134-004-5556-6
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We analyze the service times of customers in a stable M/M/1 queue in equilibrium depending on their position in a busy period. We give the law of the service of a customer at the beginning, at the end, or in the middle of the busy period. It enables as a by-product to prove that the process of instants of beginning of services is not Poisson. We then proceed to a more precise analysis. We consider a family of polynomial generating series associated with Dyck paths of length 2n and we show that they provide the correlation function of the successive services in a busy period with n + 1 customers.
引用
收藏
页码:73 / 84
页数:12
相关论文
共 12 条
[1]  
[Anonymous], 1995, LARGE DEVIATIONS PER
[2]  
[Anonymous], 1994, Concrete Mathematics: a Foundation for Computer Science
[3]  
[Anonymous], 2000, MATH APPL
[4]  
Bergeron F., 1998, Encycl. Math. Appl, V67
[5]   THE OUTPUT OF A QUEUING SYSTEM [J].
BURKE, PJ .
OPERATIONS RESEARCH, 1956, 4 (06) :699-704
[6]  
Cohen JW., 1982, SINGLE SERVER QUEUE
[7]   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
[8]   On the area swept under the occupation process of an M/M/1 queue in a busy period [J].
Guillemin, F ;
Pinchon, D .
QUEUEING SYSTEMS, 1998, 29 (2-4) :383-398
[9]   WAITING-TIMES WHEN QUEUES ARE IN TANDEM [J].
REICH, E .
ANNALS OF MATHEMATICAL STATISTICS, 1957, 28 (03) :768-773
[10]  
Stanley R.P., 1999, Enumerative Combinatorics, V2