We consider a priority polling system consisting of two queues attended by a single server. Type i customers arrive to queue i according to a homogeneous Poisson process with rate λ i . Queue i has its own buffer of finite capacity K i for i= 1 2. Customers are served in groups, with the group service time distributed according to distribution with mean . The distribution is assumed to be independent of the group size. The service discipline is as follows: at the completion of a service (of any type) the server polls queue 1 and serves all waiting customers at the same time. If there are no customers waiting in queue 1, the server polls queue 2 and serves the group that it finds upon its arrival to queue 2. If the system is empty, the server waits for the first arrival. Customers who arrive during a service wait until the server becomes free. The steady-state analysis of the model is carried out by deriving expressions for the distribution of the number of type i customers in the queue and the waiting tim...
[1]
S. Chakravarthy.
A finite capacity dynamic priority queuing model
,
1992
.
[2]
Srinivas R. Chakravarthy,et al.
A finite capacity queue with Markovian arrivals and two servers with group services
,
1994
.
[3]
Srinivas R. Chakravarthy.
A finite capacity GI/PH/1 queue with group services
,
1992
.
[4]
Lan Bin,et al.
A Finite Capacity Queue with Nonrenewal Input and Exponential Dynamic Group Services
,
1997,
INFORMS J. Comput..
[5]
Srinivas R. Chakravarthy.
A Production Capacity Queuing Model with Parallel Servers and Group Services
,
1996
.
[6]
S. Chakravarthy.
Analysis of a finite MAP/G/1 queue with group services
,
1993,
Queueing Syst. Theory Appl..
[7]
Marcel F. Neuts,et al.
Matrix-geometric solutions in stochastic models - an algorithmic approach
,
1982
.
[8]
Hideaki Takagi,et al.
Analysis of polling systems
,
1986
.