M/G/1/r retrial queueing systems with priority of primary customers

被引：10

作者：

Bocharov, PP ^{[1
]}

Pavlova, OI ^{[1
]}

Puzikova, DA ^{[1
]}

机构：

[1] Patrice Lumumba Peoples Friendship Univ, Dept Probabil Theory & Math Stat, Moscow 117198, Russia

来源：

MATHEMATICAL AND COMPUTER MODELLING | 1999年 / 30卷 / 3-4期

关键词：

retrial queueing system; Poisson arrivals; repeated attempts; steady-state (stationary) distribution; factorial moments;

D O I：

10.1016/S0895-7177(99)00134-X

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We analyse a single-server retrial queueing system with finite buffer, Poisson arrivals, and general distribution of service time. If an arriving customer finds the queue completely occupied he joins a retrial group (or orbit) in order to seek service again after an exponentially distributed amount of time. We obtain a stationary distribution of the primary queue size, a recurrent algorithm for the factorial moments of the number of retrial customers and an expression for the expected number of customers in the system. (C) 1999 Elsevier Science Ltd. All rights reserved.

引用

页码：89 / 98

页数：10